/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/array-crafted/zero_sum_const4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:15:21,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:15:21,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:15:21,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:15:21,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:15:21,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:15:21,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:15:21,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:15:21,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:15:21,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:15:21,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:15:21,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:15:21,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:15:21,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:15:21,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:15:21,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:15:21,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:15:21,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:15:21,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:15:21,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:15:21,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:15:21,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:15:21,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:15:21,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:15:21,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:15:21,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:15:21,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:15:21,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:15:21,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:15:21,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:15:21,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:15:21,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:15:21,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:15:21,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:15:21,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:15:21,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:15:21,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:15:21,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:15:21,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:15:21,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:15:21,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:15:21,098 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 20:15:21,112 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:15:21,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:15:21,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:15:21,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:15:21,115 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:15:21,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:15:21,116 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:15:21,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:15:21,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:15:21,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:15:21,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:15:21,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:15:21,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:15:21,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:15:21,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:15:21,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:15:21,118 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:15:21,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:15:21,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:15:21,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:15:21,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:15:21,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:15:21,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:15:21,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:15:21,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:15:21,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:15:21,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:15:21,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:15:21,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:15:21,122 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:15:21,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:15:21,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:15:21,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:15:21,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:15:21,429 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:15:21,430 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const4.c [2019-11-23 20:15:21,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d512af28a/f28722d206324d13ab07a8dd2f88c28a/FLAGb59e6ebe5 [2019-11-23 20:15:21,993 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:15:21,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const4.c [2019-11-23 20:15:22,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d512af28a/f28722d206324d13ab07a8dd2f88c28a/FLAGb59e6ebe5 [2019-11-23 20:15:22,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d512af28a/f28722d206324d13ab07a8dd2f88c28a [2019-11-23 20:15:22,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:15:22,392 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:15:22,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:15:22,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:15:22,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:15:22,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7423f71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22, skipping insertion in model container [2019-11-23 20:15:22,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:15:22,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:15:22,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:15:22,639 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:15:22,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:15:22,780 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:15:22,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22 WrapperNode [2019-11-23 20:15:22,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:15:22,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:15:22,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:15:22,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:15:22,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:15:22,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:15:22,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:15:22,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:15:22,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (1/1) ... [2019-11-23 20:15:22,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:15:22,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:15:22,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:15:22,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:15:22,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (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 20:15:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 20:15:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 20:15:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:15:22,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:15:22,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 20:15:23,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:15:23,274 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-11-23 20:15:23,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:15:23 BoogieIcfgContainer [2019-11-23 20:15:23,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:15:23,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:15:23,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:15:23,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:15:23,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:15:22" (1/3) ... [2019-11-23 20:15:23,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ece74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:15:23, skipping insertion in model container [2019-11-23 20:15:23,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:15:22" (2/3) ... [2019-11-23 20:15:23,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613ece74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:15:23, skipping insertion in model container [2019-11-23 20:15:23,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:15:23" (3/3) ... [2019-11-23 20:15:23,283 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const4.c [2019-11-23 20:15:23,293 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:15:23,300 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:15:23,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:15:23,357 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:15:23,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:15:23,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:15:23,358 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:15:23,358 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:15:23,358 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:15:23,358 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:15:23,358 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:15:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-11-23 20:15:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:15:23,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:23,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:23,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2094998668, now seen corresponding path program 1 times [2019-11-23 20:15:23,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:23,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473912510] [2019-11-23 20:15:23,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:23,609 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 20:15:23,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473912510] [2019-11-23 20:15:23,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:15:23,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:15:23,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665333621] [2019-11-23 20:15:23,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 20:15:23,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 20:15:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 20:15:23,638 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-11-23 20:15:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:23,661 INFO L93 Difference]: Finished difference Result 69 states and 104 transitions. [2019-11-23 20:15:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 20:15:23,663 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-11-23 20:15:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:23,671 INFO L225 Difference]: With dead ends: 69 [2019-11-23 20:15:23,672 INFO L226 Difference]: Without dead ends: 33 [2019-11-23 20:15:23,675 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 20:15:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-23 20:15:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-23 20:15:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-23 20:15:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-23 20:15:23,706 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 23 [2019-11-23 20:15:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:23,707 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-23 20:15:23,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 20:15:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-11-23 20:15:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 20:15:23,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:23,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:23,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1680934388, now seen corresponding path program 1 times [2019-11-23 20:15:23,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:23,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679880760] [2019-11-23 20:15:23,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:23,820 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 20:15:23,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679880760] [2019-11-23 20:15:23,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:15:23,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:15:23,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353673472] [2019-11-23 20:15:23,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:15:23,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:23,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:15:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:15:23,825 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 4 states. [2019-11-23 20:15:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:23,903 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2019-11-23 20:15:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:15:23,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-23 20:15:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:23,905 INFO L225 Difference]: With dead ends: 52 [2019-11-23 20:15:23,905 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 20:15:23,908 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 20:15:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 20:15:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-23 20:15:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 20:15:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-23 20:15:23,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 23 [2019-11-23 20:15:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:23,927 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-23 20:15:23,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:15:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-23 20:15:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 20:15:23,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:23,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:23,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -807143506, now seen corresponding path program 1 times [2019-11-23 20:15:23,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:23,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108483009] [2019-11-23 20:15:23,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 20:15:24,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108483009] [2019-11-23 20:15:24,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:15:24,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:15:24,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690457406] [2019-11-23 20:15:24,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:15:24,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:15:24,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:15:24,014 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 3 states. [2019-11-23 20:15:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:24,131 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2019-11-23 20:15:24,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:15:24,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 20:15:24,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:24,133 INFO L225 Difference]: With dead ends: 93 [2019-11-23 20:15:24,133 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 20:15:24,134 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 20:15:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 20:15:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-11-23 20:15:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 20:15:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2019-11-23 20:15:24,142 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 25 [2019-11-23 20:15:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:24,142 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-11-23 20:15:24,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:15:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2019-11-23 20:15:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 20:15:24,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:24,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:24,144 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:24,144 INFO L82 PathProgramCache]: Analyzing trace with hash 293663568, now seen corresponding path program 1 times [2019-11-23 20:15:24,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:24,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956131295] [2019-11-23 20:15:24,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 20:15:24,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956131295] [2019-11-23 20:15:24,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:15:24,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:15:24,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328086250] [2019-11-23 20:15:24,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:15:24,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:15:24,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:15:24,220 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 4 states. [2019-11-23 20:15:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:24,383 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2019-11-23 20:15:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:15:24,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-23 20:15:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:24,387 INFO L225 Difference]: With dead ends: 89 [2019-11-23 20:15:24,388 INFO L226 Difference]: Without dead ends: 51 [2019-11-23 20:15:24,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:15:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-23 20:15:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2019-11-23 20:15:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-23 20:15:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-11-23 20:15:24,403 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 27 [2019-11-23 20:15:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:24,403 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-11-23 20:15:24,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:15:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-11-23 20:15:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 20:15:24,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:24,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:24,407 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash -158323138, now seen corresponding path program 1 times [2019-11-23 20:15:24,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:24,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053436519] [2019-11-23 20:15:24,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:15:24,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053436519] [2019-11-23 20:15:24,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888419124] [2019-11-23 20:15:24,551 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 20:15:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:24,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:15:24,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:15:24,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:24,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-23 20:15:24,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416361997] [2019-11-23 20:15:24,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:15:24,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:24,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:15:24,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:15:24,690 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 6 states. [2019-11-23 20:15:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:24,795 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2019-11-23 20:15:24,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:15:24,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-23 20:15:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:24,796 INFO L225 Difference]: With dead ends: 81 [2019-11-23 20:15:24,796 INFO L226 Difference]: Without dead ends: 45 [2019-11-23 20:15:24,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:15:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-23 20:15:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-11-23 20:15:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 20:15:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-23 20:15:24,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 41 [2019-11-23 20:15:24,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:24,805 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-23 20:15:24,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:15:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-23 20:15:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 20:15:24,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:24,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:25,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:25,010 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash 408266208, now seen corresponding path program 2 times [2019-11-23 20:15:25,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:25,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443562506] [2019-11-23 20:15:25,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:15:25,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443562506] [2019-11-23 20:15:25,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642617492] [2019-11-23 20:15:25,133 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 20:15:25,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:15:25,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:25,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 20:15:25,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 20:15:25,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:25,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-23 20:15:25,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513049274] [2019-11-23 20:15:25,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 20:15:25,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 20:15:25,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:15:25,267 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 7 states. [2019-11-23 20:15:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:25,465 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2019-11-23 20:15:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 20:15:25,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-23 20:15:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:25,466 INFO L225 Difference]: With dead ends: 101 [2019-11-23 20:15:25,466 INFO L226 Difference]: Without dead ends: 69 [2019-11-23 20:15:25,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:15:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-23 20:15:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-11-23 20:15:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-23 20:15:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2019-11-23 20:15:25,484 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 43 [2019-11-23 20:15:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:25,484 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2019-11-23 20:15:25,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 20:15:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2019-11-23 20:15:25,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 20:15:25,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:25,491 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:25,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:25,697 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1004340752, now seen corresponding path program 3 times [2019-11-23 20:15:25,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:25,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493012619] [2019-11-23 20:15:25,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:15:27,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493012619] [2019-11-23 20:15:27,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393004254] [2019-11-23 20:15:27,263 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 20:15:27,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-23 20:15:27,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:27,333 WARN L253 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 89 conjunts are in the unsatisfiable core [2019-11-23 20:15:27,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:27,434 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 15 treesize of output 11 [2019-11-23 20:15:27,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:15:27,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:15:27,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:15:27,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-23 20:15:29,202 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:15:29,214 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:15:29,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 36 [2019-11-23 20:15:29,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:15:29,251 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-11-23 20:15:29,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:15:29,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:15:29,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:36 [2019-11-23 20:15:29,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:15:29,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:15:29,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:15:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:15:29,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:29,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 38 [2019-11-23 20:15:29,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694751822] [2019-11-23 20:15:29,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-23 20:15:29,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:29,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-23 20:15:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 20:15:29,523 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 38 states. [2019-11-23 20:15:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:32,277 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2019-11-23 20:15:32,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-23 20:15:32,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 59 [2019-11-23 20:15:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:32,281 INFO L225 Difference]: With dead ends: 169 [2019-11-23 20:15:32,281 INFO L226 Difference]: Without dead ends: 163 [2019-11-23 20:15:32,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 41 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=250, Invalid=2300, Unknown=0, NotChecked=0, Total=2550 [2019-11-23 20:15:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-23 20:15:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2019-11-23 20:15:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-23 20:15:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-11-23 20:15:32,299 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 59 [2019-11-23 20:15:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:32,299 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-11-23 20:15:32,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-23 20:15:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-11-23 20:15:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 20:15:32,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:32,301 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:32,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:32,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1580077422, now seen corresponding path program 4 times [2019-11-23 20:15:32,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:32,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100525074] [2019-11-23 20:15:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 20:15:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100525074] [2019-11-23 20:15:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471983299] [2019-11-23 20:15:32,606 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 20:15:32,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:15:32,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:32,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:15:32,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 20:15:32,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:32,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 20:15:32,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854082845] [2019-11-23 20:15:32,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:15:32,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:32,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:15:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:15:32,717 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 13 states. [2019-11-23 20:15:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:33,128 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2019-11-23 20:15:33,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 20:15:33,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-11-23 20:15:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:33,131 INFO L225 Difference]: With dead ends: 233 [2019-11-23 20:15:33,131 INFO L226 Difference]: Without dead ends: 136 [2019-11-23 20:15:33,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:15:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-23 20:15:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2019-11-23 20:15:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-23 20:15:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-11-23 20:15:33,148 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 61 [2019-11-23 20:15:33,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:33,149 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-11-23 20:15:33,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:15:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-11-23 20:15:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 20:15:33,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:33,151 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:33,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:33,354 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1506179060, now seen corresponding path program 5 times [2019-11-23 20:15:33,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:33,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241545433] [2019-11-23 20:15:33,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-23 20:15:33,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241545433] [2019-11-23 20:15:33,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828818716] [2019-11-23 20:15:33,438 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 20:15:33,633 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-23 20:15:33,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:33,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 20:15:33,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-23 20:15:33,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:33,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-23 20:15:33,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112972608] [2019-11-23 20:15:33,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 20:15:33,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 20:15:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-23 20:15:33,681 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 13 states. [2019-11-23 20:15:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:34,044 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-11-23 20:15:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 20:15:34,045 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-11-23 20:15:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:34,046 INFO L225 Difference]: With dead ends: 126 [2019-11-23 20:15:34,046 INFO L226 Difference]: Without dead ends: 86 [2019-11-23 20:15:34,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:15:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-23 20:15:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2019-11-23 20:15:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-23 20:15:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-23 20:15:34,056 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 63 [2019-11-23 20:15:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:34,056 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-23 20:15:34,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 20:15:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-23 20:15:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-23 20:15:34,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:34,058 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:34,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:34,262 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1152417058, now seen corresponding path program 6 times [2019-11-23 20:15:34,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:34,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776431196] [2019-11-23 20:15:34,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:35,305 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-11-23 20:15:35,464 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-11-23 20:15:36,091 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-23 20:15:36,264 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-11-23 20:15:36,592 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-11-23 20:15:37,226 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-11-23 20:15:37,391 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-23 20:15:37,557 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-23 20:15:37,712 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-11-23 20:15:38,292 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-11-23 20:15:38,483 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-11-23 20:15:38,653 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-11-23 20:15:39,723 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-11-23 20:15:39,912 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-11-23 20:15:40,638 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-11-23 20:15:40,818 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-23 20:15:40,998 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-23 20:15:41,565 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-23 20:15:41,793 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-23 20:15:41,972 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-11-23 20:15:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:15:42,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776431196] [2019-11-23 20:15:42,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743685490] [2019-11-23 20:15:42,905 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 20:15:42,968 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-23 20:15:42,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:42,971 WARN L253 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-23 20:15:42,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:45,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:15:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:15:45,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:45,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 42] total 100 [2019-11-23 20:15:45,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809945497] [2019-11-23 20:15:45,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-11-23 20:15:45,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:45,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-11-23 20:15:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=8797, Unknown=0, NotChecked=0, Total=9900 [2019-11-23 20:15:45,845 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 100 states. [2019-11-23 20:15:47,387 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-11-23 20:15:47,776 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-23 20:15:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:55,518 INFO L93 Difference]: Finished difference Result 208 states and 232 transitions. [2019-11-23 20:15:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-23 20:15:55,518 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 77 [2019-11-23 20:15:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:55,520 INFO L225 Difference]: With dead ends: 208 [2019-11-23 20:15:55,521 INFO L226 Difference]: Without dead ends: 204 [2019-11-23 20:15:55,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 30 SyntacticMatches, 22 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 9483 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2033, Invalid=16327, Unknown=0, NotChecked=0, Total=18360 [2019-11-23 20:15:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-23 20:15:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 147. [2019-11-23 20:15:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-23 20:15:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2019-11-23 20:15:55,541 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 77 [2019-11-23 20:15:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:55,542 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2019-11-23 20:15:55,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-11-23 20:15:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2019-11-23 20:15:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 20:15:55,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:55,544 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:55,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:55,747 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:55,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash -214262460, now seen corresponding path program 7 times [2019-11-23 20:15:55,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:55,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855102576] [2019-11-23 20:15:55,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:15:55,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855102576] [2019-11-23 20:15:55,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632955811] [2019-11-23 20:15:55,853 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 20:15:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:55,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:15:55,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:15:55,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:55,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-23 20:15:55,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530881615] [2019-11-23 20:15:55,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:15:55,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:15:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:15:55,982 INFO L87 Difference]: Start difference. First operand 147 states and 167 transitions. Second operand 16 states. [2019-11-23 20:15:56,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:56,466 INFO L93 Difference]: Finished difference Result 352 states and 397 transitions. [2019-11-23 20:15:56,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:15:56,466 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-11-23 20:15:56,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:56,468 INFO L225 Difference]: With dead ends: 352 [2019-11-23 20:15:56,469 INFO L226 Difference]: Without dead ends: 166 [2019-11-23 20:15:56,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-23 20:15:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-23 20:15:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2019-11-23 20:15:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-23 20:15:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2019-11-23 20:15:56,483 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 79 [2019-11-23 20:15:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:56,483 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2019-11-23 20:15:56,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:15:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2019-11-23 20:15:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 20:15:56,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:56,487 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:56,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:56,694 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:56,694 INFO L82 PathProgramCache]: Analyzing trace with hash 385815078, now seen corresponding path program 8 times [2019-11-23 20:15:56,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:56,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181854340] [2019-11-23 20:15:56,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 20:15:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181854340] [2019-11-23 20:15:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292668842] [2019-11-23 20:15:56,782 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 20:15:56,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 20:15:56,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:15:56,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 20:15:56,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:15:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-23 20:15:56,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:15:56,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-23 20:15:56,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573354543] [2019-11-23 20:15:56,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 20:15:56,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:15:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 20:15:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-23 20:15:56,918 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 16 states. [2019-11-23 20:15:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:15:57,440 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2019-11-23 20:15:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 20:15:57,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2019-11-23 20:15:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:15:57,441 INFO L225 Difference]: With dead ends: 156 [2019-11-23 20:15:57,441 INFO L226 Difference]: Without dead ends: 104 [2019-11-23 20:15:57,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:15:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-23 20:15:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2019-11-23 20:15:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 20:15:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-23 20:15:57,457 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 81 [2019-11-23 20:15:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:15:57,459 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-23 20:15:57,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 20:15:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-23 20:15:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-23 20:15:57,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:15:57,462 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:15:57,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:15:57,663 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:15:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:15:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1202071596, now seen corresponding path program 9 times [2019-11-23 20:15:57,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:15:57,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257074172] [2019-11-23 20:15:57,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:15:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:15:59,180 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-11-23 20:16:00,433 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 54 [2019-11-23 20:16:00,642 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-23 20:16:00,843 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-11-23 20:16:01,075 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-11-23 20:16:01,262 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-11-23 20:16:01,453 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-23 20:16:01,626 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-23 20:16:01,918 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-11-23 20:16:02,079 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-11-23 20:16:02,304 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-11-23 20:16:02,651 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2019-11-23 20:16:02,855 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-23 20:16:03,071 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-11-23 20:16:03,250 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-11-23 20:16:03,684 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-23 20:16:03,914 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-11-23 20:16:04,118 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-11-23 20:16:04,326 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-11-23 20:16:04,550 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-23 20:16:04,795 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-23 20:16:05,005 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-11-23 20:16:05,421 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-23 20:16:05,681 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-11-23 20:16:05,936 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-11-23 20:16:06,190 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-11-23 20:16:06,460 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-11-23 20:16:06,723 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-11-23 20:16:06,958 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-23 20:16:07,355 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-11-23 20:16:07,616 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-11-23 20:16:07,868 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 45 [2019-11-23 20:16:08,119 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-11-23 20:16:08,418 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-11-23 20:16:08,695 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-11-23 20:16:08,946 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-23 20:16:09,314 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-11-23 20:16:09,536 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2019-11-23 20:16:09,753 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2019-11-23 20:16:10,203 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-23 20:16:10,434 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-11-23 20:16:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:16:12,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257074172] [2019-11-23 20:16:12,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25761364] [2019-11-23 20:16:12,059 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 20:16:12,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-23 20:16:12,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:16:12,134 WARN L253 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 156 conjunts are in the unsatisfiable core [2019-11-23 20:16:12,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:16:12,186 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 15 treesize of output 11 [2019-11-23 20:16:12,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 20:16:12,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 20:16:12,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:16:12,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-23 20:16:26,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,696 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:26,714 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,717 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,718 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-23 20:16:26,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 20:16:27,002 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-11-23 20:16:27,003 INFO L343 Elim1Store]: treesize reduction 48, result has 83.3 percent of original size [2019-11-23 20:16:27,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 104 treesize of output 259 [2019-11-23 20:16:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,349 INFO L496 ElimStorePlain]: Start of recursive call 2: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-23 20:16:27,698 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 37 [2019-11-23 20:16:27,699 INFO L567 ElimStorePlain]: treesize reduction 1973, result has 3.1 percent of original size [2019-11-23 20:16:27,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:27,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 20:16:27,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:150, output treesize:33 [2019-11-23 20:16:27,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:28,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:28,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 20:16:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 7 proven. 128 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-23 20:16:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:16:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 68] total 142 [2019-11-23 20:16:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316793379] [2019-11-23 20:16:28,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-11-23 20:16:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:16:28,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-11-23 20:16:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=18511, Unknown=0, NotChecked=0, Total=20022 [2019-11-23 20:16:28,406 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 142 states. [2019-11-23 20:16:31,698 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-11-23 20:16:32,269 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 45 [2019-11-23 20:16:32,606 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 42 [2019-11-23 20:16:34,232 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-11-23 20:16:34,569 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-11-23 20:16:36,453 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-11-23 20:16:37,714 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 88 [2019-11-23 20:16:38,559 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 34 [2019-11-23 20:16:39,291 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 82 [2019-11-23 20:16:40,305 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 64 [2019-11-23 20:16:41,194 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 82 [2019-11-23 20:16:41,732 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 68 [2019-11-23 20:16:42,213 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-11-23 20:16:42,707 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-11-23 20:16:44,954 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 84 [2019-11-23 20:16:46,134 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 81 [2019-11-23 20:16:46,734 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 75 [2019-11-23 20:16:47,223 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 77 [2019-11-23 20:16:47,744 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-11-23 20:16:57,820 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-11-23 20:16:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:16:57,925 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2019-11-23 20:16:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-23 20:16:57,926 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 95 [2019-11-23 20:16:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:16:57,928 INFO L225 Difference]: With dead ends: 195 [2019-11-23 20:16:57,928 INFO L226 Difference]: Without dead ends: 191 [2019-11-23 20:16:57,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 27 SyntacticMatches, 20 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14938 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=2850, Invalid=30822, Unknown=0, NotChecked=0, Total=33672 [2019-11-23 20:16:57,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-23 20:16:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2019-11-23 20:16:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-23 20:16:57,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2019-11-23 20:16:57,946 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 95 [2019-11-23 20:16:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:16:57,947 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2019-11-23 20:16:57,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-11-23 20:16:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2019-11-23 20:16:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 20:16:57,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:16:57,948 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:16:58,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:16:58,152 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:16:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:16:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1175667574, now seen corresponding path program 10 times [2019-11-23 20:16:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:16:58,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866842299] [2019-11-23 20:16:58,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:16:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:16:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 20:16:58,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866842299] [2019-11-23 20:16:58,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510875955] [2019-11-23 20:16:58,293 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 20:16:58,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 20:16:58,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 20:16:58,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 20:16:58,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:16:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 20:16:58,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 20:16:58,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2019-11-23 20:16:58,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630188412] [2019-11-23 20:16:58,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 20:16:58,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:16:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 20:16:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-11-23 20:16:58,457 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 19 states. [2019-11-23 20:16:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:16:59,188 INFO L93 Difference]: Finished difference Result 353 states and 388 transitions. [2019-11-23 20:16:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 20:16:59,189 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-11-23 20:16:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:16:59,190 INFO L225 Difference]: With dead ends: 353 [2019-11-23 20:16:59,190 INFO L226 Difference]: Without dead ends: 196 [2019-11-23 20:16:59,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-11-23 20:16:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-23 20:16:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2019-11-23 20:16:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-23 20:16:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2019-11-23 20:16:59,207 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 97 [2019-11-23 20:16:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:16:59,208 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2019-11-23 20:16:59,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 20:16:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2019-11-23 20:16:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 20:16:59,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:16:59,209 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]