java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:33:15,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:33:15,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:33:15,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:33:15,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:33:15,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:33:15,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:33:15,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:33:15,070 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:33:15,071 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:33:15,072 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:33:15,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:33:15,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:33:15,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:33:15,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:33:15,077 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:33:15,078 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:33:15,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:33:15,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:33:15,084 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:33:15,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:33:15,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:33:15,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:33:15,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:33:15,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:33:15,091 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:33:15,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:33:15,092 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:33:15,093 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:33:15,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:33:15,095 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:33:15,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:33:15,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:33:15,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:33:15,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:33:15,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:33:15,099 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:33:15,112 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:33:15,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:33:15,113 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:33:15,113 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:33:15,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:33:15,113 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:33:15,114 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:33:15,114 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:33:15,114 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:33:15,114 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:33:15,114 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:33:15,115 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:33:15,115 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:33:15,116 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:33:15,116 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:33:15,116 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:33:15,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:33:15,116 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:33:15,117 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:33:15,118 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:33:15,118 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:33:15,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:33:15,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:33:15,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:33:15,119 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:33:15,119 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:15,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:33:15,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:33:15,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:33:15,120 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:33:15,120 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:33:15,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:33:15,120 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:33:15,120 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:33:15,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:33:15,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:33:15,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:33:15,166 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:33:15,167 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:33:15,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl [2019-02-28 13:33:15,168 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl' [2019-02-28 13:33:15,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:33:15,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:33:15,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:15,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:33:15,214 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:33:15,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:15,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:33:15,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:33:15,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:33:15,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/1) ... [2019-02-28 13:33:15,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:33:15,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:33:15,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:33:15,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:33:15,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:33:15,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:33:15,844 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-28 13:33:15,846 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:33:15,846 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-28 13:33:15,847 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:33:15 BoogieIcfgContainer [2019-02-28 13:33:15,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:33:15,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:33:15,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:33:15,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:33:15,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:15" (1/2) ... [2019-02-28 13:33:15,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae0aec5 and model type matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:33:15, skipping insertion in model container [2019-02-28 13:33:15,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:33:15" (2/2) ... [2019-02-28 13:33:15,856 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix.i_4.bpl [2019-02-28 13:33:15,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:33:15,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:33:15,890 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:33:15,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:33:15,923 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:33:15,923 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:33:15,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:33:15,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:33:15,924 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:33:15,924 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:33:15,924 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:33:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-02-28 13:33:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:33:15,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:15,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:33:15,948 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 13:33:15,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:16,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:16,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:16,320 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-02-28 13:33:16,344 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-02-28 13:33:16,347 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9#false} is VALID [2019-02-28 13:33:16,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} assume !false; {9#false} is VALID [2019-02-28 13:33:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:16,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:33:16,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:33:16,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:33:16,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:16,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:16,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:33:16,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:33:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:33:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:33:16,384 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-02-28 13:33:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:16,557 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-28 13:33:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:33:16,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:33:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-28 13:33:16,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-28 13:33:16,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:16,649 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:33:16,649 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:33:16,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:33:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:33:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-28 13:33:16,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:16,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2019-02-28 13:33:16,716 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2019-02-28 13:33:16,717 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2019-02-28 13:33:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:16,718 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:33:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:33:16,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:16,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:16,719 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2019-02-28 13:33:16,720 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2019-02-28 13:33:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:16,721 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-28 13:33:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-28 13:33:16,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:16,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:16,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:16,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:33:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-28 13:33:16,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-02-28 13:33:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:16,726 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-28 13:33:16,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:33:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-28 13:33:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:33:16,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:16,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 13:33:16,727 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:16,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:16,728 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-02-28 13:33:16,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:16,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:16,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:16,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:16,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:17,214 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2019-02-28 13:33:17,249 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} is VALID [2019-02-28 13:33:17,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} is VALID [2019-02-28 13:33:17,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {57#false} is VALID [2019-02-28 13:33:17,253 INFO L273 TraceCheckUtils]: 3: Hoare triple {57#false} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {57#false} is VALID [2019-02-28 13:33:17,253 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2019-02-28 13:33:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:33:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 13:33:17,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:33:17,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:33:17,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:17,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:33:17,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:17,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:33:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:33:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 13:33:17,272 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-28 13:33:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:17,472 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-28 13:33:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:33:17,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 13:33:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:33:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:33:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:33:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-28 13:33:17,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-28 13:33:17,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:17,519 INFO L225 Difference]: With dead ends: 11 [2019-02-28 13:33:17,519 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:33:17,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 13:33:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:33:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:33:17,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:17,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:17,551 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:17,552 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:17,553 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-28 13:33:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:33:17,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:17,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:17,554 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:17,554 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:17,555 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-28 13:33:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:33:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:17,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:17,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:33:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 13:33:17,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-28 13:33:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 13:33:17,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:33:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 13:33:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:33:17,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:17,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 13:33:17,560 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-02-28 13:33:17,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:17,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:18,039 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-02-28 13:33:18,528 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2019-02-28 13:33:18,685 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-28 13:33:18,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} is VALID [2019-02-28 13:33:18,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} is VALID [2019-02-28 13:33:18,690 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-28 13:33:18,691 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-28 13:33:18,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-28 13:33:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:18,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:18,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:18,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 13:33:18,699 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2019-02-28 13:33:18,774 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:33:18,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:33:19,472 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-28 13:33:24,441 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:33:24,463 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:26,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:33:26,167 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:26,685 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:33:26,715 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:27,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:33:27,137 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:27,293 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:33:27,296 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:27,478 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:33:27,479 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4581, output treesize:180 [2019-02-28 13:33:33,937 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 321 [2019-02-28 13:33:33,956 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:35,431 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:33:35,434 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:35,950 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:33:35,955 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:36,104 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:33:36,110 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:36,374 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:33:36,378 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:36,471 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:33:36,472 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:3535, output treesize:180 [2019-02-28 13:33:37,031 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 311 [2019-02-28 13:33:37,044 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:38,280 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:33:38,284 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:38,454 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:33:38,492 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:39,192 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:33:39,194 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:39,293 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:33:39,294 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5111, output treesize:176 [2019-02-28 13:33:55,240 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 327 [2019-02-28 13:33:55,256 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:56,900 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:33:56,903 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:57,102 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:33:57,107 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:57,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:33:57,749 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:6636, output treesize:179 [2019-02-28 13:33:58,160 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 349 [2019-02-28 13:33:58,179 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:59,824 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-02-28 13:33:59,826 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:00,177 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-02-28 13:34:00,183 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:00,473 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:00,474 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:5719, output treesize:150 [2019-02-28 13:34:09,603 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:34:09,616 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:11,104 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:34:11,132 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:11,366 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:11,369 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:11,647 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:34:11,650 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:11,901 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:11,904 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:12,083 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:12,083 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4581, output treesize:179 [2019-02-28 13:34:15,510 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:34:15,524 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:17,013 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:34:17,016 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:17,366 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:34:17,370 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:17,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:34:17,562 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:17,790 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:34:17,793 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:17,969 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:17,972 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:18,143 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:18,143 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6181, output treesize:179 [2019-02-28 13:34:22,027 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:34:22,048 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:23,542 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:23,545 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:23,829 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:34:23,837 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:24,226 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:34:24,228 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:24,402 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:24,403 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5675, output treesize:179 [2019-02-28 13:34:25,147 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:34:25,162 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:26,611 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:34:26,614 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:26,801 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:34:26,804 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:26,979 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:34:26,981 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:27,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:27,168 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:27,303 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:27,306 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:27,562 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:27,563 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6181, output treesize:181 [2019-02-28 13:34:30,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 321 [2019-02-28 13:34:30,743 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:32,396 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:32,404 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:32,590 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:32,593 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:33,220 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:33,220 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:6552, output treesize:179 [2019-02-28 13:34:35,343 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 321 [2019-02-28 13:34:35,357 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:36,986 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:34:36,988 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:37,167 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:34:37,172 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:37,441 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:37,445 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:37,807 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:34:37,808 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:6552, output treesize:179 [2019-02-28 13:34:58,252 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:34:58,263 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:34:59,745 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:34:59,748 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:00,114 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-28 13:35:00,118 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:00,560 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:00,561 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:5675, output treesize:179 [2019-02-28 13:35:01,949 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-28 13:35:01,961 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:03,338 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:03,343 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:03,550 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:35:03,554 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:04,051 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-28 13:35:04,053 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:04,310 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:04,310 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5675, output treesize:181 [2019-02-28 13:35:06,305 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:35:06,317 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:08,271 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:08,273 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:08,518 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:08,523 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:08,955 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:35:08,959 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:09,309 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:09,312 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:09,460 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:09,465 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:09,571 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:09,572 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:210 [2019-02-28 13:35:10,065 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:35:10,078 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:12,100 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:35:12,103 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:12,346 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:12,350 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:12,563 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:12,567 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:12,733 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:12,735 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:13,116 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:13,116 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5345, output treesize:211 [2019-02-28 13:35:14,513 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:35:14,524 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:16,633 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:16,636 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:16,839 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:16,843 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:17,007 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:35:17,010 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:17,159 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:17,162 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:17,567 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:17,567 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5112, output treesize:211 [2019-02-28 13:35:18,899 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:35:18,913 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:20,856 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:20,859 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:21,092 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:35:21,095 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:21,329 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:21,331 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:21,641 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:21,644 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:21,944 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:21,944 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:210 [2019-02-28 13:35:32,622 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:35:32,633 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:34,428 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:34,430 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:34,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:34,671 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:35,303 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:35,304 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:211 [2019-02-28 13:35:35,522 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:35:35,523 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_126, v_prenex_124, v_prenex_123, v_prenex_121, v_prenex_125, v_prenex_120, v_prenex_122, v_v_1491_1]. (let ((.cse82 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse87 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse86 (* 2 ULTIMATE.start_main_~k~5)) (.cse83 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse85 (+ ULTIMATE.start_main_~k~5 1)) (.cse90 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse80 (- ULTIMATE.start_main_~k~5)) (.cse89 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse79 (- ULTIMATE.start_main_~N_LIN~5)) (.cse84 (- ULTIMATE.start_main_~N_COL~5)) (.cse88 (+ ULTIMATE.start_main_~j~5 1)) (.cse91 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse81 (- ULTIMATE.start_main_~j~5))) (let ((.cse63 (+ v_idx_302 ULTIMATE.start_main_~N_LIN~5)) (.cse50 (<= 2 (+ v_idx_306 ULTIMATE.start_main_~N_LIN~5))) (.cse61 (< (+ v_idx_303 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse0 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse81) 3)) (.cse1 (<= 1 .cse91)) (.cse2 (<= ULTIMATE.start_main_~k~5 .cse88)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse81 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 2)) (.cse7 (<= .cse91 3)) (.cse8 (<= (- .cse84 .cse81) 1)) (.cse9 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse11 (<= (- .cse84 ULTIMATE.start_main_~j~5) (- 1))) (.cse12 (<= (- .cse79 ULTIMATE.start_main_~j~5) (- 1))) (.cse13 (<= (- ULTIMATE.start_main_~N_COL~5 .cse84) 2)) (.cse14 (<= .cse89 2)) (.cse15 (<= (- .cse81 ULTIMATE.start_main_~k~5) 0)) (.cse16 (<= (- ULTIMATE.start_main_~j~5 .cse80) 2)) (.cse17 (<= .cse90 2)) (.cse18 (<= (- .cse84 ULTIMATE.start_main_~k~5) (- 1))) (.cse19 (<= (- ULTIMATE.start_main_~N_COL~5 .cse81) 3)) (.cse20 (<= (- .cse80 ULTIMATE.start_main_~k~5) 0)) (.cse21 (<= ULTIMATE.start_main_~N_COL~5 .cse85)) (.cse22 (<= (- ULTIMATE.start_main_~k~5 .cse80) 2)) (.cse23 (<= (- ULTIMATE.start_main_~N_COL~5 .cse79) 2)) (.cse24 (<= 1 .cse83)) (.cse25 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~k~5 2))) (.cse26 (<= (- .cse79 ULTIMATE.start_main_~k~5) (- 1))) (.cse27 (<= (- .cse84 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse28 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse80) 2)) (.cse29 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse30 (<= .cse86 2)) (.cse31 (<= (- .cse84 .cse80) 0)) (.cse32 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse70 (< (+ v_idx_306 ULTIMATE.start_main_~k~5) 1)) (.cse33 (<= .cse87 2)) (.cse34 (<= 2 .cse90)) (.cse35 (<= 1 .cse89)) (.cse36 (<= ULTIMATE.start_main_~N_LIN~5 .cse88)) (.cse62 (<= 1 (+ v_idx_301 ULTIMATE.start_main_~N_LIN~5))) (.cse37 (<= (- ULTIMATE.start_main_~N_COL~5 .cse80) 2)) (.cse38 (<= 0 .cse87)) (.cse39 (<= (- .cse84 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse40 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse79) 2)) (.cse41 (<= 0 .cse86)) (.cse42 (<= ULTIMATE.start_main_~N_LIN~5 .cse85)) (.cse43 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse44 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse45 (<= .cse82 2)) (.cse46 (<= (- .cse84 .cse79) 0)) (.cse47 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse48 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse49 (<= (- ULTIMATE.start_main_~j~5 .cse81) 4)) (.cse51 (<= .cse83 2)) (.cse52 (<= (- .cse79 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse53 (<= (- .cse81 .cse80) 1)) (.cse54 (<= 2 .cse82)) (.cse55 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~N_LIN~5 1))) (.cse56 (<= (- .cse79 .cse81) 1)) (.cse57 (<= (- .cse79 .cse80) 0)) (.cse58 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (let ((.cse6 (select v_prenex_124 v_idx_302))) (let ((.cse10 (+ .cse6 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse6 2147483648)) (<= 0 (+ .cse6 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse7 .cse8 (<= 0 (+ (* 2 .cse6) 4294967296)) .cse9 (<= ULTIMATE.start_main_~N_COL~5 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_main_~k~5 .cse10) .cse17 (<= ULTIMATE.start_main_~j~5 (+ .cse6 2147483650)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= ULTIMATE.start_main_~N_LIN~5 .cse10) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 (<= 0 (+ .cse6 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse51 .cse52 .cse53 .cse54 (<= 0 (+ .cse6 ULTIMATE.start_main_~j~5 2147483648)) .cse55 .cse56 .cse57 .cse58))) (let ((.cse59 (select v_prenex_126 v_idx_302))) (let ((.cse60 (+ .cse59 2147483649))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~j~5 (+ .cse59 2147483650)) .cse3 .cse4 (<= ULTIMATE.start_main_~N_LIN~5 .cse60) .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse61 .cse27 .cse28 (<= ULTIMATE.start_main_~N_COL~5 .cse60) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse62 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse59 2147483648)) .cse45 .cse46 .cse47 (<= 0 (+ (* 2 .cse59) 4294967296)) .cse48 .cse49 .cse50 .cse51 (<= 0 (+ .cse59 ULTIMATE.start_main_~j~5 2147483648)) .cse52 .cse53 (<= ULTIMATE.start_main_~k~5 .cse60) .cse54 .cse55 .cse56 .cse57 .cse58))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 2 .cse63) .cse45 .cse46 .cse47 .cse48 .cse49 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (let ((.cse64 (select (select ULTIMATE.start_main_~matriz~5 v_idx_306) v_idx_302))) (let ((.cse65 (+ .cse64 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= 0 (+ (* 2 .cse64) 4294967296)) (<= ULTIMATE.start_main_~N_COL~5 .cse65) .cse9 .cse11 .cse12 (<= ULTIMATE.start_main_~k~5 .cse65) .cse13 (<= ULTIMATE.start_main_~j~5 (+ .cse64 2147483650)) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_main_~N_LIN~5 .cse65) .cse18 .cse19 (<= 0 (+ .cse64 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ .cse64 ULTIMATE.start_main_~j~5 2147483648)) (<= 0 (+ .cse64 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse20 .cse21 .cse22 .cse23 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse64 2147483648)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58))) (let ((.cse66 (select v_prenex_123 v_idx_302))) (let ((.cse67 (+ .cse66 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= 0 (+ (* 2 .cse66) 4294967296)) .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ .cse66 ULTIMATE.start_main_~j~5 2147483648)) .cse20 .cse21 (<= 0 (+ .cse66 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse22 .cse23 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse66 2147483648)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse61 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= ULTIMATE.start_main_~k~5 .cse67) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= ULTIMATE.start_main_~N_COL~5 .cse67) .cse49 (<= 0 (+ .cse66 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse50 .cse51 (<= ULTIMATE.start_main_~j~5 (+ .cse66 2147483650)) .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= ULTIMATE.start_main_~N_LIN~5 .cse67)))) (let ((.cse68 (select v_prenex_121 v_idx_302))) (let ((.cse69 (+ .cse68 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse68 2147483648)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_main_~N_COL~5 .cse69) .cse18 (<= 0 (+ (* 2 .cse68) 4294967296)) .cse19 .cse20 (<= 0 (+ .cse68 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse21 .cse22 .cse23 (<= 0 (+ .cse68 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse70 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 0 (+ .cse68 ULTIMATE.start_main_~j~5 2147483648)) .cse45 (<= ULTIMATE.start_main_~j~5 (+ .cse68 2147483650)) .cse46 .cse47 .cse48 (<= ULTIMATE.start_main_~N_LIN~5 .cse69) .cse49 .cse51 .cse52 .cse53 .cse54 (<= ULTIMATE.start_main_~k~5 .cse69) .cse55 .cse56 .cse57 .cse58))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (< .cse63 1) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (let ((.cse72 (select v_prenex_125 v_idx_302))) (let ((.cse71 (+ .cse72 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (<= ULTIMATE.start_main_~N_LIN~5 .cse71) .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ .cse72 ULTIMATE.start_main_~j~5 2147483648)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= ULTIMATE.start_main_~k~5 .cse71) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= ULTIMATE.start_main_~j~5 (+ .cse72 2147483650)) .cse33 .cse34 .cse35 .cse36 .cse62 (<= ULTIMATE.start_main_~N_COL~5 .cse71) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse72 2147483648)) .cse55 .cse56 (<= 0 (+ (* 2 .cse72) 4294967296)) .cse57 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse58))) (let ((.cse74 (select v_prenex_120 v_idx_302))) (let ((.cse73 (+ .cse74 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_main_~N_COL~5 .cse73) .cse7 .cse8 (<= 0 (+ .cse74 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse9 (<= 0 (+ (* 2 .cse74) 4294967296)) .cse11 (<= 0 (+ .cse74 ULTIMATE.start_main_~j~5 2147483648)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 (+ .cse74 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= ULTIMATE.start_main_~N_LIN~5 .cse73) .cse61 .cse29 .cse30 .cse31 .cse32 .cse70 .cse33 .cse34 .cse35 .cse36 .cse37 .cse62 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= ULTIMATE.start_main_~k~5 .cse73) .cse49 .cse51 .cse52 .cse53 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse74 2147483648)) .cse54 (<= ULTIMATE.start_main_~j~5 (+ .cse74 2147483650)) .cse55 .cse56 .cse57 .cse58))) (let ((.cse75 (select v_prenex_122 v_idx_302))) (let ((.cse76 (+ .cse75 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse75 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse5 .cse7 .cse8 (<= ULTIMATE.start_main_~k~5 .cse76) .cse9 .cse11 (<= 0 (+ .cse75 ULTIMATE.start_main_~j~5 2147483648)) .cse12 (<= ULTIMATE.start_main_~j~5 (+ .cse75 2147483650)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse61 .cse29 .cse30 .cse31 .cse32 .cse70 .cse33 .cse34 .cse35 (<= 0 (+ .cse75 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse36 .cse37 (<= ULTIMATE.start_main_~N_COL~5 .cse76) .cse38 .cse39 .cse40 .cse41 .cse42 (<= 0 (+ (* 2 .cse75) 4294967296)) .cse43 .cse44 (<= ULTIMATE.start_main_~N_LIN~5 .cse76) .cse45 .cse46 .cse47 .cse48 .cse49 .cse51 .cse52 .cse53 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse75 2147483648)) .cse54 .cse55 .cse56 .cse57 .cse58))) (let ((.cse77 (select v_v_1491_1 v_idx_302))) (let ((.cse78 (+ .cse77 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse77 2147483648)) .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~k~5 .cse78) (<= 0 (+ .cse77 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse14 .cse15 (<= 0 (+ (* 2 .cse77) 4294967296)) .cse16 .cse17 .cse18 (<= ULTIMATE.start_main_~N_LIN~5 .cse78) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 (+ .cse77 ULTIMATE.start_main_~j~5 2147483648)) (<= ULTIMATE.start_main_~N_COL~5 .cse78) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse70 .cse33 .cse34 .cse35 .cse36 .cse62 (<= 0 (+ .cse77 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= ULTIMATE.start_main_~j~5 (+ .cse77 2147483650)))))))) [2019-02-28 13:35:35,524 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) (- ULTIMATE.start_main_~N_LIN~5)) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5) 2)) (.cse5 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5) 2)) (.cse7 (+ v_idx_302 ULTIMATE.start_main_~N_LIN~5)) (.cse6 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (and (<= 0 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_306) v_idx_302) ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 (+ v_idx_306 ULTIMATE.start_main_~N_LIN~5)) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (< (+ v_idx_306 ULTIMATE.start_main_~k~5) 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 .cse7) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse7 1) .cse6))) [2019-02-28 13:35:36,872 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:35:36,888 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:38,957 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:38,959 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:39,196 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:39,199 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:39,892 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:39,895 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:40,094 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:40,094 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:9205, output treesize:211 [2019-02-28 13:35:41,815 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:35:41,831 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:43,701 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2019-02-28 13:35:43,704 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:43,884 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:43,887 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:44,487 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:44,488 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:4482, output treesize:210 [2019-02-28 13:35:45,149 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:35:45,161 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:47,006 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:35:47,010 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:47,417 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:47,420 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:47,732 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:47,734 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:48,031 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:48,031 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5345, output treesize:211 [2019-02-28 13:35:49,440 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:35:49,452 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:51,237 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:35:51,240 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:51,475 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:35:51,478 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:51,686 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:51,688 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:52,140 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:35:52,143 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:52,340 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:52,340 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:211 [2019-02-28 13:35:53,709 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:35:53,724 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:55,860 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:35:55,864 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:56,107 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:35:56,109 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:56,343 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:35:56,347 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:56,516 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:35:56,520 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:56,960 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:35:56,963 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:35:57,065 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:35:57,066 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:7181, output treesize:211 [2019-02-28 13:36:07,839 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:36:07,853 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:09,727 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:36:09,730 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:09,961 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:36:09,966 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:10,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:36:10,443 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:10,612 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:36:10,616 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:10,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:36:10,912 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:11,014 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:36:11,014 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6635, output treesize:210 [2019-02-28 13:36:12,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:36:12,517 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:14,451 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:36:14,454 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:14,697 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:36:14,700 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:14,934 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:36:14,938 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:15,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:36:15,139 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:15,523 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:36:15,529 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:15,786 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:36:15,787 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:210 [2019-02-28 13:36:55,522 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:36:55,534 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:57,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:36:57,572 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:57,815 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:36:57,821 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:58,042 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:36:58,045 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:58,444 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:36:58,446 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:58,607 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:36:58,610 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:36:58,813 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:36:58,814 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:211 [2019-02-28 13:36:59,485 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:36:59,498 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:01,352 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:01,355 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:01,735 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:37:01,740 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:02,175 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:37:02,178 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:02,377 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:02,378 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:10232, output treesize:210 [2019-02-28 13:37:03,920 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:37:03,938 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:05,745 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:05,750 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:05,911 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:05,921 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:06,071 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2019-02-28 13:37:06,076 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:06,580 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:06,581 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:211 [2019-02-28 13:37:08,084 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:37:08,101 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:10,173 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:37:10,176 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:10,377 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:10,380 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:10,959 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:10,959 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:9205, output treesize:212 [2019-02-28 13:37:23,843 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 361 [2019-02-28 13:37:23,858 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:25,487 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:25,491 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:25,938 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:25,943 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:26,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:26,231 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:26,427 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:26,428 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5975, output treesize:211 [2019-02-28 13:37:28,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:37:28,244 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:30,138 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:37:30,142 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:30,371 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:37:30,376 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:30,586 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:37:30,590 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:30,750 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:30,754 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:31,136 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:31,137 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:9205, output treesize:210 [2019-02-28 13:37:32,906 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:37:32,920 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:34,830 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:37:34,835 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:35,235 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:37:35,239 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:35,409 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:35,412 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:35,799 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:35,799 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:7181, output treesize:210 [2019-02-28 13:37:36,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:37:36,572 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:38,716 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:38,721 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:38,934 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:37:38,938 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:39,336 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:37:39,341 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:39,509 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:39,513 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:39,814 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:39,814 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:12301, output treesize:210 [2019-02-28 13:37:42,521 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:37:42,542 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:44,630 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:37:44,635 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:44,884 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:37:44,888 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:45,103 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:37:45,134 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:45,381 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:37:45,419 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:45,691 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:45,696 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:45,862 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:45,902 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:46,097 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:46,098 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:210 [2019-02-28 13:37:48,026 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 366 [2019-02-28 13:37:48,043 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:50,168 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:50,172 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:50,371 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:37:50,375 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:50,532 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:37:50,535 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:37:51,007 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:37:51,007 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:10296, output treesize:211 [2019-02-28 13:38:02,684 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:02,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:04,689 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:38:04,693 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:05,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:05,443 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:05,588 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:38:05,592 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:05,694 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:05,695 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:7652, output treesize:211 [2019-02-28 13:38:07,458 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:07,478 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:09,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:09,529 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:09,743 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:09,746 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:10,047 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:10,051 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:10,434 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:10,435 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:7652, output treesize:210 [2019-02-28 13:38:12,137 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:38:12,152 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:14,195 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:38:14,200 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:14,449 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:14,453 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:14,689 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:38:14,693 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:15,150 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:38:15,154 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:15,357 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:15,358 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5355, output treesize:211 [2019-02-28 13:38:18,415 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:18,436 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:20,649 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:38:20,653 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:20,896 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:20,901 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:21,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:38:21,326 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:21,492 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:21,497 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:21,789 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:21,793 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:21,901 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:21,901 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:10252, output treesize:211 [2019-02-28 13:38:23,830 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:23,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:26,162 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:38:26,165 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:26,547 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:38:26,553 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:26,854 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:26,858 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:27,054 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:27,054 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:10232, output treesize:211 [2019-02-28 13:38:28,795 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:38:28,811 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:30,523 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:38:30,529 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:30,982 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:30,986 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:31,277 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:38:31,281 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:31,384 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:31,384 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:211 [2019-02-28 13:38:42,583 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:42,600 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:44,665 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:44,669 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:45,047 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:38:45,051 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:45,232 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:45,235 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:45,395 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:45,399 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:45,596 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:45,597 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:211 [2019-02-28 13:38:47,735 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:47,819 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:49,900 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:49,904 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:50,132 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2019-02-28 13:38:50,137 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:50,359 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:50,363 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:50,550 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:50,554 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:50,709 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:50,713 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:51,000 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:51,003 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:51,111 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:51,111 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:10252, output treesize:212 [2019-02-28 13:38:52,772 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:38:52,787 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:54,663 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:38:54,667 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:54,903 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-02-28 13:38:54,906 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:55,138 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:55,143 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:55,614 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:38:55,618 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:55,820 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:55,820 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:211 [2019-02-28 13:38:56,422 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:38:56,440 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:58,473 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:58,476 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:58,730 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-02-28 13:38:58,734 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:58,975 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:38:58,980 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:59,226 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:38:59,232 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:59,607 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:38:59,611 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:38:59,813 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:38:59,813 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4482, output treesize:211 [2019-02-28 13:39:01,427 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 366 [2019-02-28 13:39:01,445 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:03,522 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:39:03,526 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:03,730 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-02-28 13:39:03,735 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:03,922 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:39:03,926 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:04,090 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:39:04,098 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:04,439 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:04,450 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:04,599 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:04,600 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4149, output treesize:211 [2019-02-28 13:39:04,640 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:39:04,641 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_v_1491_1, v_prenex_321, v_prenex_318, v_prenex_316, v_prenex_319, v_prenex_322, v_prenex_317, v_prenex_320]. (let ((.cse81 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse86 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse85 (* 2 ULTIMATE.start_main_~k~5)) (.cse82 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse84 (+ ULTIMATE.start_main_~k~5 1)) (.cse89 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse79 (- ULTIMATE.start_main_~k~5)) (.cse88 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse78 (- ULTIMATE.start_main_~N_LIN~5)) (.cse83 (- ULTIMATE.start_main_~N_COL~5)) (.cse87 (+ ULTIMATE.start_main_~j~5 1)) (.cse90 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse80 (- ULTIMATE.start_main_~j~5))) (let ((.cse61 (< (+ v_idx_720 ULTIMATE.start_main_~k~5) 1)) (.cse67 (< (+ v_idx_717 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse27 (<= 2 (+ v_idx_720 ULTIMATE.start_main_~N_LIN~5))) (.cse64 (<= 1 (+ v_idx_715 ULTIMATE.start_main_~N_LIN~5))) (.cse0 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse80) 3)) (.cse1 (<= 1 .cse90)) (.cse2 (<= ULTIMATE.start_main_~k~5 .cse87)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse80 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 2)) (.cse6 (<= .cse90 3)) (.cse7 (<= (- .cse83 .cse80) 1)) (.cse9 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse10 (<= (- .cse83 ULTIMATE.start_main_~j~5) (- 1))) (.cse11 (<= (- .cse78 ULTIMATE.start_main_~j~5) (- 1))) (.cse12 (<= (- ULTIMATE.start_main_~N_COL~5 .cse83) 2)) (.cse13 (<= .cse88 2)) (.cse14 (<= (- .cse80 ULTIMATE.start_main_~k~5) 0)) (.cse16 (<= (- ULTIMATE.start_main_~j~5 .cse79) 2)) (.cse17 (<= .cse89 2)) (.cse18 (<= (- .cse83 ULTIMATE.start_main_~k~5) (- 1))) (.cse19 (<= (- ULTIMATE.start_main_~N_COL~5 .cse80) 3)) (.cse20 (<= (- .cse79 ULTIMATE.start_main_~k~5) 0)) (.cse21 (<= ULTIMATE.start_main_~N_COL~5 .cse84)) (.cse22 (<= (- ULTIMATE.start_main_~k~5 .cse79) 2)) (.cse23 (<= (- ULTIMATE.start_main_~N_COL~5 .cse78) 2)) (.cse24 (<= 1 .cse82)) (.cse25 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~k~5 2))) (.cse26 (<= (- .cse78 ULTIMATE.start_main_~k~5) (- 1))) (.cse28 (<= (- .cse83 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse29 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse79) 2)) (.cse30 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse31 (<= .cse85 2)) (.cse32 (<= (- .cse83 .cse79) 0)) (.cse33 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse34 (<= .cse86 2)) (.cse35 (<= 2 .cse89)) (.cse36 (<= 1 .cse88)) (.cse37 (<= ULTIMATE.start_main_~N_LIN~5 .cse87)) (.cse38 (<= (- ULTIMATE.start_main_~N_COL~5 .cse79) 2)) (.cse39 (<= 0 .cse86)) (.cse40 (<= (- .cse83 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse41 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse78) 2)) (.cse42 (<= 0 .cse85)) (.cse43 (<= ULTIMATE.start_main_~N_LIN~5 .cse84)) (.cse44 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse45 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse46 (<= .cse81 2)) (.cse47 (<= (- .cse83 .cse78) 0)) (.cse48 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse49 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse50 (<= (- ULTIMATE.start_main_~j~5 .cse80) 4)) (.cse51 (<= .cse82 2)) (.cse52 (<= (- .cse78 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse53 (<= (- .cse80 .cse79) 1)) (.cse54 (<= 2 .cse81)) (.cse55 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~N_LIN~5 1))) (.cse56 (<= (- .cse78 .cse80) 1)) (.cse57 (<= (- .cse78 .cse79) 0)) (.cse58 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (let ((.cse8 (select v_prenex_321 v_idx_716))) (let ((.cse15 (+ .cse8 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~j~5 (+ .cse8 2147483650)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_main_~N_COL~5 .cse15) .cse16 (<= 0 (+ (* 2 .cse8) 4294967296)) .cse17 .cse18 .cse19 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse8 2147483648)) .cse20 .cse21 .cse22 .cse23 (<= ULTIMATE.start_main_~k~5 .cse15) .cse24 .cse25 .cse26 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse8 2147483648)) .cse27 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse8 2147483647)) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 (<= ULTIMATE.start_main_~N_LIN~5 .cse15) .cse54 .cse55 .cse56 (<= 0 (+ .cse8 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse57 .cse58 (<= 0 (+ .cse8 ULTIMATE.start_main_~N_LIN~5 2147483647))))) (let ((.cse59 (select v_prenex_318 v_idx_716))) (let ((.cse60 (+ .cse59 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse59 2147483647)) (<= ULTIMATE.start_main_~N_LIN~5 .cse60) .cse9 .cse10 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse59 2147483648)) .cse11 .cse12 .cse13 .cse61 .cse14 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse59 2147483648)) (<= ULTIMATE.start_main_~k~5 .cse60) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse33 .cse34 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (<= ULTIMATE.start_main_~j~5 (+ .cse59 2147483650)) (<= 0 (+ (* 2 .cse59) 4294967296)) .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 (<= ULTIMATE.start_main_~N_COL~5 .cse60) .cse55 .cse56 .cse57 .cse58))) (let ((.cse63 (select v_prenex_316 v_idx_716))) (let ((.cse62 (+ .cse63 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= ULTIMATE.start_main_~N_LIN~5 .cse62) (<= ULTIMATE.start_main_~k~5 .cse62) (<= ULTIMATE.start_main_~N_COL~5 .cse62) (<= 0 (+ .cse63 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse10 .cse11 (<= 0 (+ .cse63 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse12 .cse61 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_main_~j~5 (+ .cse63 2147483650)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse64 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse63 2147483647)) .cse44 .cse45 (<= 0 (+ (* 2 .cse63) 4294967296)) .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse63 2147483648)) .cse53 .cse54 .cse55 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse63 2147483648)) .cse56 .cse57 .cse58))) (let ((.cse65 (select v_v_1491_1 v_idx_716))) (let ((.cse66 (+ .cse65 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (<= 0 (+ (* 2 .cse65) 4294967296)) .cse11 .cse12 .cse13 .cse61 .cse14 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_main_~j~5 (+ .cse65 2147483650)) (<= 0 (+ .cse65 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse20 .cse21 (<= ULTIMATE.start_main_~k~5 .cse66) .cse22 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse65 2147483648)) .cse23 .cse24 .cse25 .cse26 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse65 2147483648)) (<= ULTIMATE.start_main_~N_LIN~5 .cse66) (<= 0 (+ .cse65 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse64 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse65 2147483647)) .cse50 .cse67 .cse51 .cse52 .cse53 .cse54 (<= ULTIMATE.start_main_~N_COL~5 .cse66) .cse55 .cse56 .cse57 .cse58))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_716)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58) (let ((.cse68 (select v_prenex_319 v_idx_716))) (let ((.cse69 (+ .cse68 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= 0 (+ .cse68 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse68 2147483647)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 (<= ULTIMATE.start_main_~N_LIN~5 .cse69) .cse18 (<= ULTIMATE.start_main_~j~5 (+ .cse68 2147483650)) .cse19 .cse20 (<= 0 (+ (* 2 .cse68) 4294967296)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (<= ULTIMATE.start_main_~N_COL~5 .cse69) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse68 2147483648)) (<= 0 (+ .cse68 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse49 .cse50 .cse67 .cse51 .cse52 .cse53 (<= ULTIMATE.start_main_~k~5 .cse69) (<= 0 (+ ULTIMATE.start_main_~j~5 .cse68 2147483648)) .cse54 .cse55 .cse56 .cse57 .cse58))) (let ((.cse71 (select v_prenex_322 v_idx_716))) (let ((.cse70 (+ .cse71 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~N_COL~5 .cse70) .cse14 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ .cse71 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse20 (<= 0 (+ .cse71 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse64 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 0 (+ (* 2 .cse71) 4294967296)) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= ULTIMATE.start_main_~k~5 .cse70) .cse49 .cse50 .cse67 .cse51 .cse52 .cse53 (<= ULTIMATE.start_main_~j~5 (+ .cse71 2147483650)) .cse54 .cse55 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse71 2147483648)) .cse56 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse71 2147483647)) .cse57 .cse58 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse71 2147483648)) (<= ULTIMATE.start_main_~N_LIN~5 .cse70)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 (< (+ v_idx_716 ULTIMATE.start_main_~N_LIN~5) 1) .cse54 .cse55 .cse56 .cse57 .cse58) (let ((.cse72 (select v_prenex_317 v_idx_716))) (let ((.cse73 (+ .cse72 2147483649))) (and .cse0 .cse1 .cse2 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse12 .cse61 .cse13 .cse14 .cse16 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse72 2147483648)) .cse17 .cse18 .cse19 .cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse73) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse72 2147483647)) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= ULTIMATE.start_main_~j~5 (+ .cse72 2147483650)) .cse35 .cse36 .cse37 .cse38 (<= 0 (+ (* 2 .cse72) 4294967296)) .cse39 .cse40 (<= ULTIMATE.start_main_~N_LIN~5 .cse73) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse72 2147483648)) .cse49 .cse50 .cse67 .cse51 .cse52 .cse53 (<= ULTIMATE.start_main_~k~5 .cse73) .cse54 .cse55 .cse56 .cse57 .cse58))) (let ((.cse75 (select v_prenex_320 v_idx_716))) (let ((.cse74 (+ .cse75 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~N_LIN~5 .cse74) .cse9 .cse10 .cse11 .cse12 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse75 2147483648)) .cse13 .cse14 .cse16 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse75 2147483648)) .cse17 .cse18 .cse19 (<= 0 (+ (* 2 .cse75) 4294967296)) .cse20 .cse21 .cse22 (<= ULTIMATE.start_main_~k~5 .cse74) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse64 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 (<= ULTIMATE.start_main_~N_COL~5 .cse74) .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse75 2147483647)) (<= ULTIMATE.start_main_~j~5 (+ .cse75 2147483650)) .cse54 .cse55 (<= 0 (+ .cse75 ULTIMATE.start_main_~N_LIN~5 2147483647)) (<= 0 (+ .cse75 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse56 .cse57 .cse58))) (let ((.cse77 (select (select ULTIMATE.start_main_~matriz~5 v_idx_720) v_idx_716))) (let ((.cse76 (+ .cse77 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~N_COL~5 .cse76) (<= 0 (+ .cse77 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ (* 2 .cse77) 4294967296)) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 0 (+ .cse77 ULTIMATE.start_main_~j~5 2147483648)) .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= ULTIMATE.start_main_~N_LIN~5 .cse76) .cse35 .cse36 (<= ULTIMATE.start_main_~k~5 .cse76) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (<= ULTIMATE.start_main_~j~5 (+ .cse77 2147483650)) .cse46 .cse47 .cse48 .cse49 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse77 2147483648)) .cse50 .cse51 .cse52 .cse53 (<= 0 (+ .cse77 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse54 .cse55 .cse56 .cse57 .cse58)))))) [2019-02-28 13:39:04,641 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) (- ULTIMATE.start_main_~N_LIN~5)) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5) 2)) (.cse5 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5) 2)) (.cse6 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_716)) .cse6) (and .cse0 .cse1 (<= 0 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_720) v_idx_716) ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 (+ v_idx_720 ULTIMATE.start_main_~N_LIN~5)) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< (+ v_idx_720 ULTIMATE.start_main_~k~5) 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< (+ v_idx_716 ULTIMATE.start_main_~N_LIN~5) 1)))) [2019-02-28 13:39:06,146 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:39:06,162 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:07,822 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:07,826 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:08,429 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:08,429 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:5345, output treesize:210 [2019-02-28 13:39:19,221 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:39:19,240 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:21,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2019-02-28 13:39:21,637 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:21,911 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:21,915 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:22,164 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:39:22,168 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:22,387 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:22,391 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:22,603 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:39:22,607 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:22,772 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:22,776 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:22,981 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:22,981 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:11274, output treesize:210 [2019-02-28 13:39:23,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:39:23,587 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:25,562 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:25,565 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:25,740 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:39:25,744 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:26,330 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:26,330 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:4482, output treesize:210 [2019-02-28 13:39:28,097 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:39:28,116 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:30,174 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:39:30,180 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:30,604 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:30,609 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:31,000 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:39:31,005 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:31,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:31,169 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:31,313 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:31,317 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:31,422 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:31,423 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:7652, output treesize:210 [2019-02-28 13:39:32,078 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:39:32,096 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:34,373 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:34,376 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:34,757 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:39:34,761 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:35,105 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:35,108 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:35,264 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:35,268 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:35,375 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:35,375 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:7652, output treesize:211 [2019-02-28 13:39:46,689 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:39:46,710 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:48,870 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:39:48,875 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:49,043 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:39:49,046 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:49,437 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:49,438 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:10232, output treesize:210 [2019-02-28 13:39:50,018 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:39:50,034 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:52,173 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:39:52,177 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:52,426 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:39:52,431 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:52,645 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:39:52,649 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:52,850 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:39:52,854 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:53,015 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:39:53,018 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:39:53,309 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:39:53,310 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4482, output treesize:210 [2019-02-28 13:40:05,075 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:40:05,092 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:07,172 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:07,177 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:07,418 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:40:07,421 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:07,654 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:07,659 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:07,866 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:07,871 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:08,036 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:40:08,040 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:08,327 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:08,331 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:08,440 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:08,440 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:4482, output treesize:212 [2019-02-28 13:40:09,034 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:40:09,064 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:11,113 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:11,123 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:11,382 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:40:11,385 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:11,764 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:11,768 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:12,075 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:12,079 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:12,225 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:40:12,229 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:12,339 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:12,340 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:212 [2019-02-28 13:40:23,958 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:40:23,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:25,731 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:40:25,734 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:26,115 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:26,120 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:26,663 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:26,667 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:26,863 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:26,864 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:210 [2019-02-28 13:40:27,495 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:40:27,513 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:29,542 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:29,546 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:29,748 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:29,752 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:30,328 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:30,329 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:5911, output treesize:211 [2019-02-28 13:40:42,289 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:40:42,309 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:44,186 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:40:44,191 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:44,432 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:40:44,436 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:44,653 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:44,657 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:44,975 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:44,979 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:45,278 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:45,278 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5345, output treesize:212 [2019-02-28 13:40:45,883 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:40:45,901 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:47,885 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:40:47,890 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:48,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:40:48,140 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:48,378 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:40:48,381 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:48,577 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:40:48,581 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:40:48,975 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:40:48,975 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4085, output treesize:211 [2019-02-28 13:41:01,210 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:41:01,225 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:03,436 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:41:03,440 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:03,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:03,913 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:04,350 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:04,354 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:04,462 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:04,463 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:10232, output treesize:210 [2019-02-28 13:41:05,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:41:05,157 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:07,296 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:41:07,302 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:07,571 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:41:07,575 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:07,793 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:07,797 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:08,007 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:08,011 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:08,411 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:08,416 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:08,579 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:41:08,583 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:08,692 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:08,693 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:5911, output treesize:210 [2019-02-28 13:41:21,220 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 366 [2019-02-28 13:41:21,236 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:23,067 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2019-02-28 13:41:23,071 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:23,307 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:23,312 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:23,525 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:23,529 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:23,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:41:23,839 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:24,133 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:24,133 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5409, output treesize:212 [2019-02-28 13:41:24,871 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:41:24,892 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:26,955 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:41:26,959 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:27,200 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:27,206 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:27,423 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:41:27,428 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:27,645 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:27,653 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:27,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:27,998 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:28,196 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:28,197 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:9205, output treesize:212 [2019-02-28 13:41:28,217 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:41:28,219 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_441, v_prenex_440, v_prenex_436, v_prenex_437, v_prenex_438, v_v_1491_1, v_prenex_435, v_prenex_439]. (let ((.cse83 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse88 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse87 (* 2 ULTIMATE.start_main_~k~5)) (.cse84 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse86 (+ ULTIMATE.start_main_~k~5 1)) (.cse92 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse81 (- ULTIMATE.start_main_~k~5)) (.cse91 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse80 (- ULTIMATE.start_main_~N_LIN~5)) (.cse85 (- ULTIMATE.start_main_~N_COL~5)) (.cse90 (+ ULTIMATE.start_main_~j~5 1)) (.cse93 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse82 (- ULTIMATE.start_main_~j~5)) (.cse89 (+ v_idx_1046 ULTIMATE.start_main_~N_LIN~5))) (let ((.cse65 (<= 1 (+ v_idx_1045 ULTIMATE.start_main_~N_LIN~5))) (.cse52 (<= 2 .cse89)) (.cse62 (< (+ ULTIMATE.start_main_~k~5 v_idx_1050) 1)) (.cse0 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse82) 3)) (.cse1 (<= 1 .cse93)) (.cse2 (<= ULTIMATE.start_main_~k~5 .cse90)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse82 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= 2 (+ v_idx_1050 ULTIMATE.start_main_~N_LIN~5))) (.cse6 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 2)) (.cse7 (<= .cse93 3)) (.cse8 (<= (- .cse85 .cse82) 1)) (.cse9 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse10 (<= (- .cse85 ULTIMATE.start_main_~j~5) (- 1))) (.cse11 (<= (- .cse80 ULTIMATE.start_main_~j~5) (- 1))) (.cse12 (<= (- ULTIMATE.start_main_~N_COL~5 .cse85) 2)) (.cse13 (<= .cse91 2)) (.cse14 (<= (- .cse82 ULTIMATE.start_main_~k~5) 0)) (.cse15 (<= (- ULTIMATE.start_main_~j~5 .cse81) 2)) (.cse16 (<= .cse92 2)) (.cse17 (<= (- .cse85 ULTIMATE.start_main_~k~5) (- 1))) (.cse18 (<= (- ULTIMATE.start_main_~N_COL~5 .cse82) 3)) (.cse19 (<= (- .cse81 ULTIMATE.start_main_~k~5) 0)) (.cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse86)) (.cse21 (<= (- ULTIMATE.start_main_~k~5 .cse81) 2)) (.cse22 (<= (- ULTIMATE.start_main_~N_COL~5 .cse80) 2)) (.cse23 (<= 1 .cse84)) (.cse24 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~k~5 2))) (.cse25 (<= (- .cse80 ULTIMATE.start_main_~k~5) (- 1))) (.cse26 (<= (- .cse85 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse27 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse81) 2)) (.cse28 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse29 (<= .cse87 2)) (.cse30 (<= (- .cse85 .cse81) 0)) (.cse31 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse32 (<= .cse88 2)) (.cse33 (<= 2 .cse92)) (.cse34 (<= 1 .cse91)) (.cse35 (<= ULTIMATE.start_main_~N_LIN~5 .cse90)) (.cse36 (<= (- ULTIMATE.start_main_~N_COL~5 .cse81) 2)) (.cse58 (< .cse89 1)) (.cse37 (<= 0 .cse88)) (.cse38 (<= (- .cse85 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse39 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse80) 2)) (.cse40 (<= 0 .cse87)) (.cse41 (<= ULTIMATE.start_main_~N_LIN~5 .cse86)) (.cse42 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse43 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse44 (<= .cse83 2)) (.cse45 (<= (- .cse85 .cse80) 0)) (.cse46 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse47 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse48 (<= (- ULTIMATE.start_main_~j~5 .cse82) 4)) (.cse49 (<= .cse84 2)) (.cse50 (<= (- .cse80 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse51 (<= (- .cse82 .cse81) 1)) (.cse61 (< (+ v_idx_1047 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse53 (<= 2 .cse83)) (.cse54 (<= ULTIMATE.start_main_~j~5 (+ ULTIMATE.start_main_~N_LIN~5 1))) (.cse55 (<= (- .cse80 .cse82) 1)) (.cse56 (<= (- .cse80 .cse81) 0)) (.cse57 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55 .cse56 .cse57) (let ((.cse59 (select v_prenex_440 v_idx_1046))) (let ((.cse60 (+ .cse59 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (<= ULTIMATE.start_main_~j~5 (+ .cse59 2147483650)) .cse9 .cse10 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= ULTIMATE.start_main_~N_LIN~5 .cse60) .cse25 (<= 0 (+ (* 2 .cse59) 4294967296)) (<= 0 (+ .cse59 ULTIMATE.start_main_~k~5 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~N_COL~5 .cse60) .cse50 .cse51 .cse61 .cse53 (<= 0 (+ .cse59 ULTIMATE.start_main_~j~5 2147483648)) .cse54 (<= 0 (+ .cse59 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse55 .cse62 .cse56 .cse57 (<= ULTIMATE.start_main_~k~5 .cse60)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse61 .cse53 .cse54 .cse55 .cse56 .cse57) (let ((.cse63 (select v_prenex_436 v_idx_1046))) (let ((.cse64 (+ .cse63 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 0 (+ .cse63 ULTIMATE.start_main_~j~5 2147483648)) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 0 (+ (* 2 .cse63) 4294967296)) .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_main_~k~5 .cse64) .cse18 (<= 0 (+ .cse63 ULTIMATE.start_main_~k~5 2147483648)) .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= ULTIMATE.start_main_~j~5 (+ .cse63 2147483650)) .cse33 .cse34 (<= 0 (+ .cse63 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= 0 (+ .cse63 ULTIMATE.start_main_~N_LIN~5 2147483647)) (<= ULTIMATE.start_main_~N_LIN~5 .cse64) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 (<= ULTIMATE.start_main_~N_COL~5 .cse64) .cse55 .cse56 .cse57))) (let ((.cse67 (select v_prenex_437 v_idx_1046))) (let ((.cse66 (+ .cse67 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_main_~k~5 .cse66) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= 0 (+ .cse67 ULTIMATE.start_main_~j~5 2147483648)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (<= 0 (+ (* 2 .cse67) 4294967296)) (<= 0 (+ .cse67 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= ULTIMATE.start_main_~N_COL~5 .cse66) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 (<= 0 (+ .cse67 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse47 .cse48 .cse49 .cse50 .cse51 (<= ULTIMATE.start_main_~N_LIN~5 .cse66) .cse53 .cse54 (<= 0 (+ .cse67 ULTIMATE.start_main_~k~5 2147483648)) .cse55 .cse56 .cse57 (<= ULTIMATE.start_main_~j~5 (+ .cse67 2147483650))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse61 .cse53 .cse54 .cse55 .cse56 .cse57) (let ((.cse69 (select (select ULTIMATE.start_main_~matriz~5 v_idx_1050) v_idx_1046))) (let ((.cse68 (+ .cse69 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_main_~N_LIN~5 .cse68) .cse10 (<= 0 (+ .cse69 ULTIMATE.start_main_~k~5 2147483648)) .cse11 .cse12 .cse13 .cse14 (<= 0 (+ .cse69 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse15 .cse16 .cse17 .cse18 (<= ULTIMATE.start_main_~k~5 .cse68) .cse19 .cse20 .cse21 .cse22 (<= 0 (+ .cse69 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse23 .cse24 .cse25 (<= ULTIMATE.start_main_~N_COL~5 .cse68) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~j~5 (+ .cse69 2147483650)) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 (<= 0 (+ .cse69 ULTIMATE.start_main_~j~5 2147483648)) .cse55 .cse56 .cse57 (<= 0 (+ (* 2 .cse69) 4294967296))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55 .cse56 .cse57) (let ((.cse70 (select v_prenex_441 v_idx_1046))) (let ((.cse71 (+ .cse70 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= 0 (+ (* 2 .cse70) 4294967296)) .cse7 .cse8 (<= 0 (+ .cse70 ULTIMATE.start_main_~k~5 2147483648)) .cse9 (<= 0 (+ .cse70 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ULTIMATE.start_main_~j~5 (+ .cse70 2147483650)) .cse18 .cse65 .cse19 .cse20 (<= ULTIMATE.start_main_~N_LIN~5 .cse71) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~N_COL~5 .cse71) .cse44 (<= 0 (+ .cse70 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 (<= 0 (+ .cse70 ULTIMATE.start_main_~j~5 2147483648)) .cse51 (<= ULTIMATE.start_main_~k~5 .cse71) .cse61 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse58 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55 .cse56 .cse57) (let ((.cse72 (select v_prenex_438 v_idx_1046))) (let ((.cse73 (+ .cse72 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ (* 2 .cse72) 4294967296)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ULTIMATE.start_main_~j~5 (+ .cse72 2147483650)) .cse15 .cse16 .cse17 .cse18 (<= 0 (+ .cse72 ULTIMATE.start_main_~j~5 2147483648)) .cse19 .cse20 .cse21 (<= ULTIMATE.start_main_~k~5 .cse73) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~N_LIN~5 .cse73) (<= 0 (+ .cse72 ULTIMATE.start_main_~k~5 2147483648)) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_LIN~5 2147483647)) (<= 0 (+ .cse72 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse53 .cse54 .cse55 .cse62 (<= ULTIMATE.start_main_~N_COL~5 .cse73) .cse56 .cse57))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse61 .cse53 .cse54 .cse55 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse61 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (let ((.cse75 (select v_v_1491_1 v_idx_1046))) (let ((.cse74 (+ .cse75 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 (<= ULTIMATE.start_main_~N_LIN~5 .cse74) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 (+ (* 2 .cse75) 4294967296)) (<= 0 (+ .cse75 ULTIMATE.start_main_~j~5 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= ULTIMATE.start_main_~k~5 .cse74) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~N_COL~5 .cse74) .cse50 (<= 0 (+ .cse75 ULTIMATE.start_main_~k~5 2147483648)) (<= 0 (+ .cse75 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse51 .cse61 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ .cse75 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= ULTIMATE.start_main_~j~5 (+ .cse75 2147483650))))) (let ((.cse76 (select v_prenex_435 v_idx_1046))) (let ((.cse77 (+ .cse76 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ (* 2 .cse76) 4294967296)) .cse6 .cse7 .cse8 (<= ULTIMATE.start_main_~j~5 (+ .cse76 2147483650)) (<= ULTIMATE.start_main_~N_LIN~5 .cse77) .cse9 .cse10 .cse11 .cse12 (<= 0 (+ .cse76 ULTIMATE.start_main_~k~5 2147483648)) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 0 (+ .cse76 ULTIMATE.start_main_~j~5 2147483648)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 (+ .cse76 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~N_COL~5 .cse77) .cse44 .cse45 .cse46 (<= 0 (+ .cse76 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse47 .cse48 .cse49 .cse50 .cse51 .cse61 .cse53 (<= ULTIMATE.start_main_~k~5 .cse77) .cse54 .cse55 .cse56 .cse57))) (let ((.cse79 (select v_prenex_439 v_idx_1046))) (let ((.cse78 (+ .cse79 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_main_~N_LIN~5 .cse78) .cse12 (<= 0 (+ (* 2 .cse79) 4294967296)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 (<= 0 (+ .cse79 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse23 .cse24 .cse25 (<= 0 (+ .cse79 ULTIMATE.start_main_~j~5 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= ULTIMATE.start_main_~N_COL~5 .cse78) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= 0 (+ .cse79 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse39 .cse40 .cse41 .cse42 .cse43 (<= 0 (+ .cse79 ULTIMATE.start_main_~k~5 2147483648)) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~j~5 (+ .cse79 2147483650)) .cse50 .cse51 .cse53 (<= ULTIMATE.start_main_~k~5 .cse78) .cse54 .cse55 .cse62 .cse56 .cse57))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse61 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse61 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse65 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse61 .cse53 .cse54 .cse55 .cse62 .cse56 .cse57) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse61 .cse53 .cse54 .cse55 .cse56 .cse57)))) [2019-02-28 13:41:28,219 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse7 (+ v_idx_1046 ULTIMATE.start_main_~N_LIN~5)) (.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) (- ULTIMATE.start_main_~N_LIN~5)) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5) 2)) (.cse5 (<= (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5) 2)) (.cse6 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< .cse7 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 (+ (* 2 (select (select ULTIMATE.start_main_~matriz~5 v_idx_1050) v_idx_1046)) 4294967296))) (and .cse0 .cse1 (<= 2 (+ v_idx_1050 ULTIMATE.start_main_~N_LIN~5)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 .cse7)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ ULTIMATE.start_main_~k~5 v_idx_1050) 1) .cse6))) [2019-02-28 13:41:40,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 371 [2019-02-28 13:41:40,951 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:43,063 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-02-28 13:41:43,068 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:43,381 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:43,386 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:43,624 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:43,628 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:43,838 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:41:43,843 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:44,045 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:41:44,050 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:44,350 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:44,355 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:44,460 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:44,461 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:5112, output treesize:211 [2019-02-28 13:41:45,083 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 379 treesize of output 361 [2019-02-28 13:41:45,098 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:46,592 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:41:46,597 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:46,902 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:41:46,906 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:47,052 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:41:47,057 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:41:47,442 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:41:47,442 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5281, output treesize:211 [2019-02-28 13:42:02,449 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:42:02,470 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:04,388 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:42:04,392 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:04,841 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-28 13:42:04,846 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:05,173 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2019-02-28 13:42:05,178 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:05,331 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:42:05,336 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:05,544 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:42:05,544 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5355, output treesize:210 [2019-02-28 13:42:06,220 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 366 [2019-02-28 13:42:06,237 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:08,214 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-28 13:42:08,218 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:08,455 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2019-02-28 13:42:08,459 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:09,016 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-28 13:42:09,020 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:09,230 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-28 13:42:09,235 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:09,406 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2019-02-28 13:42:09,411 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:09,561 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-28 13:42:09,566 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:09,675 INFO L315 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-28 13:42:09,676 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:7181, output treesize:211 [2019-02-28 13:42:11,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:42:11,305 INFO L272 AbstractInterpreter]: Visited 6 different actions 123 times. Merged at 5 different actions 84 times. Widened at 4 different actions 57 times. Found 35 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-28 13:42:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:42:11,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:42:11,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:42:11,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:42:11,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:42:11,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:42:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:42:11,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 13:42:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:42:11,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:42:11,471 INFO L442 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 9 [2019-02-28 13:42:11,472 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:11,484 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 13:42:11,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-02-28 13:42:11,500 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:42:11,501 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~matriz~5_7, ULTIMATE.start_main_~j~5, |v_ULTIMATE.start_main_#t~nondet3_4|]. (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 .cse0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (store v_ULTIMATE.start_main_~matriz~5_7 .cse0 (store (select v_ULTIMATE.start_main_~matriz~5_7 .cse0) 0 |v_ULTIMATE.start_main_#t~nondet3_4|)) ULTIMATE.start_main_~matriz~5) (<= ULTIMATE.start_main_~j~5 0))) [2019-02-28 13:42:11,501 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~j~5]. (and (<= (select (select ULTIMATE.start_main_~matriz~5 (mod ULTIMATE.start_main_~j~5 4294967296)) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0)) [2019-02-28 13:42:11,530 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-28 13:42:11,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-28 13:42:11,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-28 13:42:11,534 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-28 13:42:11,535 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-28 13:42:11,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-28 13:42:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:42:11,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:42:11,675 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-02-28 13:42:11,678 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:11,691 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-02-28 13:42:11,699 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:42:11,703 INFO L315 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:42:11,709 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-02-28 13:42:11,709 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-02-28 13:42:11,712 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:42:11,712 WARN L398 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~matriz~5, |ULTIMATE.start_main_#t~nondet3|]. (< (select (select (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (store ULTIMATE.start_main_~matriz~5 .cse0 (store (select ULTIMATE.start_main_~matriz~5 .cse0) (mod ULTIMATE.start_main_~k~5 4294967296) |ULTIMATE.start_main_#t~nondet3|))) 0) 0) (+ |ULTIMATE.start_main_#t~nondet3| 1)) [2019-02-28 13:42:11,713 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296))) [2019-02-28 13:42:11,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-28 13:42:11,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-28 13:42:11,793 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-28 13:42:11,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-28 13:42:11,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-02-28 13:42:11,804 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} is VALID [2019-02-28 13:42:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:42:11,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:42:11,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-02-28 13:42:11,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:42:11,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:42:11,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:42:11,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-28 13:42:11,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:42:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 13:42:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 13:42:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:42:11,839 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2019-02-28 13:42:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:42:12,004 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-02-28 13:42:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:42:12,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:42:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:42:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:42:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-28 13:42:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:42:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-28 13:42:12,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-02-28 13:42:12,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:42:12,023 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:42:12,023 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:42:12,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-28 13:42:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:42:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:42:12,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:42:12,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:42:12,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:42:12,024 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:42:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:42:12,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:42:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:42:12,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:42:12,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:42:12,025 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:42:12,025 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:42:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:42:12,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:42:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:42:12,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:42:12,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:42:12,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:42:12,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:42:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:42:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:42:12,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-28 13:42:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:42:12,027 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:42:12,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 13:42:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:42:12,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:42:12,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:42:12,363 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-02-28 13:42:12,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2019-02-28 13:42:12,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2019-02-28 13:42:12,370 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-28 13:42:12,371 INFO L444 ceAbstractionStarter]: At program point L59(lines 29 59) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~j~5 4294967296))) (let ((.cse0 (< 0 (+ .cse3 1))) (.cse1 (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0)) (.cse2 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~j~5 0) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) .cse3)) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 .cse1 .cse2)))) [2019-02-28 13:42:12,371 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 47) the Hoare annotation is: false [2019-02-28 13:42:12,371 INFO L444 ceAbstractionStarter]: At program point L70(lines 46 70) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1))) (.cse2 (div ULTIMATE.start_main_~N_LIN~5 4294967296)) (.cse1 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (= ULTIMATE.start_main_~k~5 0) .cse0 .cse1 (<= ULTIMATE.start_main_~j~5 0) (<= .cse2 (div ULTIMATE.start_main_~k~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 (<= .cse2 0) .cse1))) [2019-02-28 13:42:12,373 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-28 13:42:12,375 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:42:12,379 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-28 13:42:12,385 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:42:12 BoogieIcfgContainer [2019-02-28 13:42:12,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:42:12,387 INFO L168 Benchmark]: Toolchain (without parser) took 537174.44 ms. Allocated memory was 134.2 MB in the beginning and 285.2 MB in the end (delta: 151.0 MB). Free memory was 109.2 MB in the beginning and 207.8 MB in the end (delta: -98.6 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2019-02-28 13:42:12,387 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:42:12,387 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-02-28 13:42:12,388 INFO L168 Benchmark]: Boogie Preprocessor took 22.26 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 106.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:42:12,388 INFO L168 Benchmark]: RCFGBuilder took 574.13 ms. Allocated memory is still 134.2 MB. Free memory was 106.4 MB in the beginning and 93.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-02-28 13:42:12,388 INFO L168 Benchmark]: TraceAbstraction took 536536.80 ms. Allocated memory was 134.2 MB in the beginning and 285.2 MB in the end (delta: 151.0 MB). Free memory was 93.4 MB in the beginning and 207.8 MB in the end (delta: -114.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:42:12,390 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 134.2 MB. Free memory is still 110.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 134.2 MB. Free memory was 109.2 MB in the beginning and 107.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.26 ms. Allocated memory is still 134.2 MB. Free memory was 107.5 MB in the beginning and 106.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 574.13 ms. Allocated memory is still 134.2 MB. Free memory was 106.4 MB in the beginning and 93.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 536536.80 ms. Allocated memory was 134.2 MB in the beginning and 285.2 MB in the end (delta: 151.0 MB). Free memory was 93.4 MB in the beginning and 207.8 MB in the end (delta: -114.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((main_~j~5 + 1 <= main_~N_COL~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_COL~5 / 4294967296 <= main_~j~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((main_~k~5 == 0 && 0 < main_~j~5 / 4294967296 + 1) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_LIN~5 / 4294967296 <= main_~k~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 536.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 532.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 9 NumberOfFragments, 104 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 7 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...