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 --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:28:07,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:28:07,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:28:07,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:28:07,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:28:07,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:28:07,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:28:07,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:28:07,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:28:07,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:28:07,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:28:07,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:28:07,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:28:07,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:28:07,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:28:07,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:28:07,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:28:07,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:28:07,062 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:28:07,064 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:28:07,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:28:07,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:28:07,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:28:07,069 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:28:07,069 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:28:07,070 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:28:07,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:28:07,072 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:28:07,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:28:07,073 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:28:07,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:28:07,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:28:07,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:28:07,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:28:07,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:28:07,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:28:07,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:28:07,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:28:07,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:28:07,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:28:07,119 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:28:07,122 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:28:07,124 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:28:07,124 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:28:07,125 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-limited.bpl [2019-05-15 10:28:07,125 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-limited.bpl' [2019-05-15 10:28:07,163 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:28:07,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:28:07,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:28:07,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:28:07,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:28:07,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:28:07,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:28:07,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:28:07,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:28:07,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/1) ... [2019-05-15 10:28:07,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:28:07,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:28:07,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:28:07,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:28:07,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-05-15 10:28:07,337 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-05-15 10:28:07,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:28:07,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:28:07,627 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:28:07,627 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-05-15 10:28:07,628 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:28:07 BoogieIcfgContainer [2019-05-15 10:28:07,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:28:07,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:28:07,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:28:07,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:28:07,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:28:07" (1/2) ... [2019-05-15 10:28:07,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4455a4f4 and model type speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:28:07, skipping insertion in model container [2019-05-15 10:28:07,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:28:07" (2/2) ... [2019-05-15 10:28:07,638 INFO L109 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-limited.bpl [2019-05-15 10:28:07,648 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:28:07,658 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:28:07,677 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:28:07,705 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:28:07,706 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:28:07,706 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:28:07,706 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:28:07,706 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:28:07,706 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:28:07,706 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:28:07,707 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:28:07,707 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:28:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-05-15 10:28:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-05-15 10:28:07,730 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:07,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-05-15 10:28:07,734 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:07,740 INFO L82 PathProgramCache]: Analyzing trace with hash 924552, now seen corresponding path program 1 times [2019-05-15 10:28:07,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:07,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:28:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:07,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:08,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:08,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:08,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:08,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:08,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|]. (= |#memory_int| (store |v_#memory_int_7| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:08,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:08,204 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_p1; {10#true} is VALID [2019-05-15 10:28:08,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10#true} is VALID [2019-05-15 10:28:08,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#true} #memory_int := #memory_int[main_p1 := 0]; {21#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:08,213 INFO L273 TraceCheckUtils]: 3: Hoare triple {21#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {11#false} is VALID [2019-05-15 10:28:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:08,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:28:08,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-15 10:28:08,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:28:08,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:08,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:28:08,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:08,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:28:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:28:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:28:08,260 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-05-15 10:28:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,361 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:08,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:28:08,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-05-15 10:28:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:28:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:28:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:28:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-05-15 10:28:08,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2019-05-15 10:28:08,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:08,428 INFO L225 Difference]: With dead ends: 10 [2019-05-15 10:28:08,429 INFO L226 Difference]: Without dead ends: 6 [2019-05-15 10:28:08,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:28:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-05-15 10:28:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-15 10:28:08,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:08,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:08,461 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:08,461 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,463 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:28:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:08,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:08,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:08,464 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:08,464 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-05-15 10:28:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:08,466 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-05-15 10:28:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:08,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:08,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:08,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:08,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-05-15 10:28:08,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-05-15 10:28:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:08,471 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-05-15 10:28:08,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:28:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-05-15 10:28:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-05-15 10:28:08,472 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:08,472 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-05-15 10:28:08,472 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 28661058, now seen corresponding path program 1 times [2019-05-15 10:28:08,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:08,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:28:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:08,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:08,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:08,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:08,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:08,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:08,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|]. (= |#memory_int| (store |v_#memory_int_8| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:08,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:08,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:08,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:08,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:08,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:08,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:08,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|]. (let ((.cse0 (select |v_#memory_int_9| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_9| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:08,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:08,930 INFO L273 TraceCheckUtils]: 0: Hoare triple {52#true} havoc main_p1; {52#true} is VALID [2019-05-15 10:28:08,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {52#true} is VALID [2019-05-15 10:28:08,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} #memory_int := #memory_int[main_p1 := 0]; {63#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:08,954 INFO L273 TraceCheckUtils]: 3: Hoare triple {63#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {67#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:08,968 INFO L273 TraceCheckUtils]: 4: Hoare triple {67#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {53#false} is VALID [2019-05-15 10:28:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:08,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:08,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:28:08,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:28:08,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:08,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:28:09,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:09,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:28:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:28:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:28:09,010 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-05-15 10:28:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,110 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:28:09,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-15 10:28:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:28:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-05-15 10:28:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:28:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-05-15 10:28:09,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-05-15 10:28:09,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:09,132 INFO L225 Difference]: With dead ends: 7 [2019-05-15 10:28:09,132 INFO L226 Difference]: Without dead ends: 7 [2019-05-15 10:28:09,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:28:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-05-15 10:28:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-05-15 10:28:09,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:09,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:09,135 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:09,135 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,137 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:09,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:09,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:09,138 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:09,138 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-05-15 10:28:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,139 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-05-15 10:28:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:09,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:09,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:09,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:09,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:09,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-05-15 10:28:09,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-05-15 10:28:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:09,142 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-05-15 10:28:09,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:28:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-05-15 10:28:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-05-15 10:28:09,142 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:09,143 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-05-15 10:28:09,143 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash 888492744, now seen corresponding path program 2 times [2019-05-15 10:28:09,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:09,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:28:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:09,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:09,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:09,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:09,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|]. (= (store |v_#memory_int_10| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:09,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:09,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:09,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:09,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|]. (let ((.cse0 (select |v_#memory_int_11| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_11| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:09,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:09,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:09,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:09,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|]. (let ((.cse0 (select |v_#memory_int_12| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_12| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:09,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:09,402 INFO L273 TraceCheckUtils]: 0: Hoare triple {98#true} havoc main_p1; {98#true} is VALID [2019-05-15 10:28:09,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {98#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {98#true} is VALID [2019-05-15 10:28:09,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {98#true} #memory_int := #memory_int[main_p1 := 0]; {109#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:09,405 INFO L273 TraceCheckUtils]: 3: Hoare triple {109#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {113#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:09,406 INFO L273 TraceCheckUtils]: 4: Hoare triple {113#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {117#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:09,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {117#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} assume !(#memory_int[main_p1] >= 0); {99#false} is VALID [2019-05-15 10:28:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:09,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:09,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-15 10:28:09,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:28:09,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:09,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:28:09,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:09,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:28:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:28:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:28:09,430 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-05-15 10:28:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,522 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:28:09,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-05-15 10:28:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:28:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-05-15 10:28:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:28:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-05-15 10:28:09,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 9 transitions. [2019-05-15 10:28:09,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:09,620 INFO L225 Difference]: With dead ends: 8 [2019-05-15 10:28:09,620 INFO L226 Difference]: Without dead ends: 8 [2019-05-15 10:28:09,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:28:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-05-15 10:28:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-15 10:28:09,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:09,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:09,622 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:09,622 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,624 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:09,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:09,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:09,624 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:09,624 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-05-15 10:28:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:09,625 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-05-15 10:28:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:09,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:09,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:09,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:09,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-05-15 10:28:09,627 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-05-15 10:28:09,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:09,627 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-05-15 10:28:09,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:28:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-05-15 10:28:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-05-15 10:28:09,628 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:09,628 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-05-15 10:28:09,628 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:09,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:09,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1773471234, now seen corresponding path program 3 times [2019-05-15 10:28:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:09,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:28:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:09,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:09,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:09,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:09,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|]. (= (store |v_#memory_int_13| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:09,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:09,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:09,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:09,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:09,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|]. (let ((.cse0 (select |v_#memory_int_14| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_14| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:09,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:09,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:09,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:09,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:09,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|]. (let ((.cse0 (select |v_#memory_int_15| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_15| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:10,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:10,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|]. (let ((.cse0 (select |v_#memory_int_16| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_16| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:10,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:10,121 INFO L273 TraceCheckUtils]: 0: Hoare triple {152#true} havoc main_p1; {152#true} is VALID [2019-05-15 10:28:10,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {152#true} is VALID [2019-05-15 10:28:10,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} #memory_int := #memory_int[main_p1 := 0]; {163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:10,124 INFO L273 TraceCheckUtils]: 3: Hoare triple {163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:10,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:10,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:10,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} assume !(#memory_int[main_p1] >= 0); {153#false} is VALID [2019-05-15 10:28:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:10,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:10,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-15 10:28:10,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-05-15 10:28:10,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:10,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:28:10,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:10,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:28:10,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:28:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:28:10,139 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-05-15 10:28:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,275 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:10,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:28:10,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-05-15 10:28:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:28:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:28:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-05-15 10:28:10,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-05-15 10:28:10,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:10,292 INFO L225 Difference]: With dead ends: 9 [2019-05-15 10:28:10,292 INFO L226 Difference]: Without dead ends: 9 [2019-05-15 10:28:10,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:28:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-05-15 10:28:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-05-15 10:28:10,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:10,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:10,295 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:10,296 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,297 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:10,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:10,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:10,298 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:10,298 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-05-15 10:28:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,299 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-05-15 10:28:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:10,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:10,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:10,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:10,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-15 10:28:10,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-05-15 10:28:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:10,301 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-05-15 10:28:10,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:28:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:28:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:28:10,302 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:10,302 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-05-15 10:28:10,303 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -856966648, now seen corresponding path program 4 times [2019-05-15 10:28:10,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-15 10:28:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:10,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:10,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:10,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|]. (= (store |v_#memory_int_17| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:10,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:10,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|]. (let ((.cse0 (select |v_#memory_int_18| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_18| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:10,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:10,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|]. (let ((.cse0 (select |v_#memory_int_19| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_19| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:10,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:10,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|]. (let ((.cse0 (select |v_#memory_int_20| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_20| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:10,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:10,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|]. (let ((.cse0 (select |v_#memory_int_21| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_21| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:10,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:10,600 INFO L273 TraceCheckUtils]: 0: Hoare triple {214#true} havoc main_p1; {214#true} is VALID [2019-05-15 10:28:10,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {214#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {214#true} is VALID [2019-05-15 10:28:10,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#true} #memory_int := #memory_int[main_p1 := 0]; {225#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:10,603 INFO L273 TraceCheckUtils]: 3: Hoare triple {225#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {229#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:10,604 INFO L273 TraceCheckUtils]: 4: Hoare triple {229#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {233#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:10,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {233#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {237#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:10,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {237#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {241#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:10,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} assume !(#memory_int[main_p1] >= 0); {215#false} is VALID [2019-05-15 10:28:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:10,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:10,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-15 10:28:10,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-05-15 10:28:10,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:10,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-05-15 10:28:10,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:10,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-05-15 10:28:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-15 10:28:10,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:28:10,628 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-05-15 10:28:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,763 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:10,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-15 10:28:10,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-05-15 10:28:10,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-05-15 10:28:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-05-15 10:28:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2019-05-15 10:28:10,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 11 transitions. [2019-05-15 10:28:10,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:10,778 INFO L225 Difference]: With dead ends: 10 [2019-05-15 10:28:10,778 INFO L226 Difference]: Without dead ends: 10 [2019-05-15 10:28:10,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-05-15 10:28:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-05-15 10:28:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-05-15 10:28:10,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:10,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:10,781 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:10,781 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,782 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:10,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:10,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:10,782 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:10,782 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-05-15 10:28:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:10,783 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-05-15 10:28:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:10,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:10,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:10,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:10,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:10,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-05-15 10:28:10,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-05-15 10:28:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:10,786 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-05-15 10:28:10,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-05-15 10:28:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-05-15 10:28:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-05-15 10:28:10,786 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:10,786 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-05-15 10:28:10,787 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -796162366, now seen corresponding path program 5 times [2019-05-15 10:28:10,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-15 10:28:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:10,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:10,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:10,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:10,846 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|]. (= (store |v_#memory_int_22| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:10,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:10,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|]. (let ((.cse0 (select |v_#memory_int_23| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_23| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:10,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:10,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_24| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:10,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:10,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:10,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:10,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:10,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:10,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:10,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|]. (let ((.cse0 (select |v_#memory_int_25| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_25| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:10,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:11,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|]. (let ((.cse0 (select |v_#memory_int_26| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_26| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:11,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:11,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,085 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_27| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:11,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:11,093 INFO L273 TraceCheckUtils]: 0: Hoare triple {284#true} havoc main_p1; {284#true} is VALID [2019-05-15 10:28:11,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {284#true} is VALID [2019-05-15 10:28:11,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} #memory_int := #memory_int[main_p1 := 0]; {295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:11,095 INFO L273 TraceCheckUtils]: 3: Hoare triple {295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:11,096 INFO L273 TraceCheckUtils]: 4: Hoare triple {299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:11,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:11,097 INFO L273 TraceCheckUtils]: 6: Hoare triple {307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:11,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:11,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} assume !(#memory_int[main_p1] >= 0); {285#false} is VALID [2019-05-15 10:28:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:11,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-15 10:28:11,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-05-15 10:28:11,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:11,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-05-15 10:28:11,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-05-15 10:28:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-15 10:28:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:28:11,116 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-05-15 10:28:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,268 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-15 10:28:11,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-05-15 10:28:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:28:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-05-15 10:28:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-05-15 10:28:11,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 12 transitions. [2019-05-15 10:28:11,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,286 INFO L225 Difference]: With dead ends: 11 [2019-05-15 10:28:11,286 INFO L226 Difference]: Without dead ends: 11 [2019-05-15 10:28:11,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-05-15 10:28:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-05-15 10:28:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-05-15 10:28:11,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:11,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:11,289 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:11,289 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,290 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:11,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,290 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:11,290 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-05-15 10:28:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,291 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-05-15 10:28:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:11,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:11,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-05-15 10:28:11,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-05-15 10:28:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:11,294 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-05-15 10:28:11,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-05-15 10:28:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-05-15 10:28:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-05-15 10:28:11,294 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:11,295 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-05-15 10:28:11,295 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:11,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:11,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1088770376, now seen corresponding path program 6 times [2019-05-15 10:28:11,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-15 10:28:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:11,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:11,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:11,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|]. (= (store |v_#memory_int_28| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:11,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:11,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_29|]. (let ((.cse0 (select |v_#memory_int_29| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_29| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:11,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:11,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|]. (let ((.cse0 (select |v_#memory_int_30| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_30| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:11,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:11,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|]. (let ((.cse0 (select |v_#memory_int_31| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_31| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:11,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:11,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|]. (let ((.cse0 (select |v_#memory_int_32| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_32| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:11,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:11,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_33|]. (let ((.cse0 (select |v_#memory_int_33| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_33| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:11,595 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:11,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:11,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:11,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:11,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|]. (let ((.cse0 (select |v_#memory_int_34| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_34| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:11,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:11,680 INFO L273 TraceCheckUtils]: 0: Hoare triple {362#true} havoc main_p1; {362#true} is VALID [2019-05-15 10:28:11,680 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {362#true} is VALID [2019-05-15 10:28:11,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} #memory_int := #memory_int[main_p1 := 0]; {373#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:11,682 INFO L273 TraceCheckUtils]: 3: Hoare triple {373#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {377#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:11,684 INFO L273 TraceCheckUtils]: 4: Hoare triple {377#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {381#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:11,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {385#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:11,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {385#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {389#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:11,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {393#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:11,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {397#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:11,692 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} assume !(#memory_int[main_p1] >= 0); {363#false} is VALID [2019-05-15 10:28:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:11,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-15 10:28:11,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-05-15 10:28:11,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:11,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-05-15 10:28:11,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-05-15 10:28:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-15 10:28:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:28:11,721 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2019-05-15 10:28:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,934 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:11,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-15 10:28:11,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-05-15 10:28:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-05-15 10:28:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:28:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-05-15 10:28:11,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 13 transitions. [2019-05-15 10:28:11,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:11,948 INFO L225 Difference]: With dead ends: 12 [2019-05-15 10:28:11,948 INFO L226 Difference]: Without dead ends: 12 [2019-05-15 10:28:11,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:28:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-05-15 10:28:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-05-15 10:28:11,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:11,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:11,951 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:11,951 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,952 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:11,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,952 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:11,953 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-05-15 10:28:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:11,954 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-05-15 10:28:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:11,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:11,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:11,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:11,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-05-15 10:28:11,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-05-15 10:28:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:11,956 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-05-15 10:28:11,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-05-15 10:28:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-05-15 10:28:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-05-15 10:28:11,956 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:11,957 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-05-15 10:28:11,957 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash -607856766, now seen corresponding path program 7 times [2019-05-15 10:28:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-15 10:28:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:11,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:11,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:11,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:11,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:11,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:12,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|]. (= (store |v_#memory_int_35| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:12,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:12,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|]. (let ((.cse0 (select |v_#memory_int_36| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_36| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:12,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:12,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|]. (let ((.cse0 (select |v_#memory_int_37| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_37| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:12,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:12,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|]. (let ((.cse0 (select |v_#memory_int_38| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_38| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:12,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:12,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,193 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|]. (let ((.cse0 (select |v_#memory_int_39| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_39| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:12,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:12,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|]. (let ((.cse0 (select |v_#memory_int_40| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_40| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:12,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:12,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|]. (let ((.cse0 (select |v_#memory_int_41| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_41| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:12,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:12,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,289 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|]. (let ((.cse0 (select |v_#memory_int_42| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_42| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:12,289 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:12,300 INFO L273 TraceCheckUtils]: 0: Hoare triple {448#true} havoc main_p1; {448#true} is VALID [2019-05-15 10:28:12,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {448#true} is VALID [2019-05-15 10:28:12,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} #memory_int := #memory_int[main_p1 := 0]; {459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:12,306 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:12,306 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:12,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:12,308 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:12,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:12,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:12,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:12,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} assume !(#memory_int[main_p1] >= 0); {449#false} is VALID [2019-05-15 10:28:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:12,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:12,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-15 10:28:12,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-05-15 10:28:12,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:12,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-05-15 10:28:12,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:12,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-05-15 10:28:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-15 10:28:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:12,339 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2019-05-15 10:28:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,566 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:12,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-15 10:28:12,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-05-15 10:28:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-05-15 10:28:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-05-15 10:28:12,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 14 transitions. [2019-05-15 10:28:12,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:12,581 INFO L225 Difference]: With dead ends: 13 [2019-05-15 10:28:12,581 INFO L226 Difference]: Without dead ends: 13 [2019-05-15 10:28:12,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-05-15 10:28:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-05-15 10:28:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-05-15 10:28:12,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:12,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:12,584 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:12,584 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:12,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,585 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:12,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,586 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:12,586 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-05-15 10:28:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:12,587 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-05-15 10:28:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:12,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:12,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:12,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:12,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-05-15 10:28:12,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-05-15 10:28:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:12,589 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-05-15 10:28:12,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-05-15 10:28:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-05-15 10:28:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-05-15 10:28:12,590 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:12,590 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-05-15 10:28:12,590 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1663690616, now seen corresponding path program 8 times [2019-05-15 10:28:12,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-15 10:28:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:12,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:12,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:12,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:12,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|]. (= (store |v_#memory_int_43| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:12,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:12,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|]. (let ((.cse0 (select |v_#memory_int_44| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_44| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:12,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:12,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|]. (let ((.cse0 (select |v_#memory_int_45| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_45| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:12,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:12,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_46| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:12,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:12,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|]. (let ((.cse0 (select |v_#memory_int_47| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_47| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:12,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:12,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_48| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:12,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:12,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|]. (let ((.cse0 (select |v_#memory_int_49| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_49| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:28:12,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:12,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|]. (let ((.cse0 (select |v_#memory_int_50| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_50| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:12,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:12,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:12,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:12,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:12,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:12,905 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:12,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_51| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:28:12,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:12,921 INFO L273 TraceCheckUtils]: 0: Hoare triple {542#true} havoc main_p1; {542#true} is VALID [2019-05-15 10:28:12,922 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {542#true} is VALID [2019-05-15 10:28:12,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} #memory_int := #memory_int[main_p1 := 0]; {553#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:12,925 INFO L273 TraceCheckUtils]: 3: Hoare triple {553#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {557#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:12,926 INFO L273 TraceCheckUtils]: 4: Hoare triple {557#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {561#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:12,927 INFO L273 TraceCheckUtils]: 5: Hoare triple {561#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {565#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:12,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {565#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {569#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:12,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {569#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {573#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:12,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {577#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:12,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {581#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:12,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {581#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {585#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:12,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {585#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} assume !(#memory_int[main_p1] >= 0); {543#false} is VALID [2019-05-15 10:28:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:12,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-15 10:28:12,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-05-15 10:28:12,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:12,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2019-05-15 10:28:12,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:12,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-05-15 10:28:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-15 10:28:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-15 10:28:12,953 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-05-15 10:28:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,234 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-15 10:28:13,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-05-15 10:28:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-05-15 10:28:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-05-15 10:28:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-05-15 10:28:13,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 15 transitions. [2019-05-15 10:28:13,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:13,249 INFO L225 Difference]: With dead ends: 14 [2019-05-15 10:28:13,249 INFO L226 Difference]: Without dead ends: 14 [2019-05-15 10:28:13,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-05-15 10:28:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-05-15 10:28:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-05-15 10:28:13,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:13,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:13,252 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:13,252 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,253 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:13,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,254 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:13,254 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2019-05-15 10:28:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:13,255 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:28:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:13,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:13,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:13,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:13,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-05-15 10:28:13,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-05-15 10:28:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:13,257 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-05-15 10:28:13,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-05-15 10:28:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:28:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-05-15 10:28:13,258 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:13,258 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-05-15 10:28:13,259 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash -34801598, now seen corresponding path program 9 times [2019-05-15 10:28:13,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-15 10:28:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:13,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:13,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:13,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:13,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|]. (= (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:13,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:13,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,388 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_53| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:13,388 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:13,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|]. (let ((.cse0 (select |v_#memory_int_54| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_54| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:13,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:13,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|]. (let ((.cse0 (select |v_#memory_int_55| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_55| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:13,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:13,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_56|]. (let ((.cse0 (select |v_#memory_int_56| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_56| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:13,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:13,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_57|]. (let ((.cse0 (select |v_#memory_int_57| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_57| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:13,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:13,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_58|]. (let ((.cse0 (select |v_#memory_int_58| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_58| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:13,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:13,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_59|]. (let ((.cse0 (select |v_#memory_int_59| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_59| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:28:13,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:13,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|]. (let ((.cse0 (select |v_#memory_int_60| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_60| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:13,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:13,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:13,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:13,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:13,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:13,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:13,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|]. (let ((.cse0 (select |v_#memory_int_61| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_61| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:13,835 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:13,847 INFO L273 TraceCheckUtils]: 0: Hoare triple {644#true} havoc main_p1; {644#true} is VALID [2019-05-15 10:28:13,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {644#true} is VALID [2019-05-15 10:28:13,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} #memory_int := #memory_int[main_p1 := 0]; {655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:13,850 INFO L273 TraceCheckUtils]: 3: Hoare triple {655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:13,851 INFO L273 TraceCheckUtils]: 4: Hoare triple {659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:13,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:13,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:13,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:13,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:13,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:13,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:13,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:13,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} assume !(#memory_int[main_p1] >= 0); {645#false} is VALID [2019-05-15 10:28:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:13,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:13,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-15 10:28:13,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-05-15 10:28:13,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:13,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2019-05-15 10:28:13,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:13,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-05-15 10:28:13,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-15 10:28:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:13,880 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-05-15 10:28:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,354 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:14,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-15 10:28:14,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-05-15 10:28:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-05-15 10:28:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-15 10:28:14,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 16 transitions. [2019-05-15 10:28:14,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:14,456 INFO L225 Difference]: With dead ends: 15 [2019-05-15 10:28:14,456 INFO L226 Difference]: Without dead ends: 15 [2019-05-15 10:28:14,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-05-15 10:28:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-05-15 10:28:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-05-15 10:28:14,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:14,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:14,458 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:14,458 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,459 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:14,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,460 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:14,460 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-05-15 10:28:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:14,461 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-05-15 10:28:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:14,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:14,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:14,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:14,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-15 10:28:14,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-05-15 10:28:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:14,463 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-05-15 10:28:14,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-05-15 10:28:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:28:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-05-15 10:28:14,464 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:14,464 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-05-15 10:28:14,464 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1078849592, now seen corresponding path program 10 times [2019-05-15 10:28:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:28:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:14,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:14,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:14,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:14,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_62|]. (= (store |v_#memory_int_62| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:14,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:14,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|]. (let ((.cse0 (select |v_#memory_int_63| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_63| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:14,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:14,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_64|]. (let ((.cse0 (select |v_#memory_int_64| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_64| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:14,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_65|]. (let ((.cse0 (select |v_#memory_int_65| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_65| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:28:14,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:14,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_66|]. (let ((.cse0 (select |v_#memory_int_66| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_66| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:14,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:14,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|]. (let ((.cse0 (select |v_#memory_int_67| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_67| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:14,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|]. (let ((.cse0 (select |v_#memory_int_68| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_68| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:14,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:14,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_69|]. (let ((.cse0 (select |v_#memory_int_69| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_69| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:14,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:14,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_70|]. (let ((.cse0 (select |v_#memory_int_70| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_70| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:14,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:14,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:14,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:14,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_71|]. (let ((.cse0 (select |v_#memory_int_71| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_71| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:28:14,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:14,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:14,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:14,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:14,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_72|]. (let ((.cse0 (select |v_#memory_int_72| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_72| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:15,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:15,018 INFO L273 TraceCheckUtils]: 0: Hoare triple {754#true} havoc main_p1; {754#true} is VALID [2019-05-15 10:28:15,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {754#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {754#true} is VALID [2019-05-15 10:28:15,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {754#true} #memory_int := #memory_int[main_p1 := 0]; {765#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:15,020 INFO L273 TraceCheckUtils]: 3: Hoare triple {765#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {769#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:15,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {769#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {773#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:15,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {773#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {777#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:15,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {777#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {781#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:15,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {781#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {785#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:15,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {785#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {789#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:15,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {789#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {793#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:15,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {793#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {797#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:15,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {801#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:15,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {801#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {805#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:15,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {805#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} assume !(#memory_int[main_p1] >= 0); {755#false} is VALID [2019-05-15 10:28:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:15,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:15,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-15 10:28:15,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-05-15 10:28:15,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:15,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2019-05-15 10:28:15,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:15,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-05-15 10:28:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-15 10:28:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:28:15,049 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2019-05-15 10:28:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,381 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-15 10:28:15,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-05-15 10:28:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-05-15 10:28:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-05-15 10:28:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-05-15 10:28:15,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 17 transitions. [2019-05-15 10:28:15,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:15,402 INFO L225 Difference]: With dead ends: 16 [2019-05-15 10:28:15,402 INFO L226 Difference]: Without dead ends: 16 [2019-05-15 10:28:15,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:28:15,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-05-15 10:28:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-05-15 10:28:15,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:15,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:15,405 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:15,405 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,406 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:15,406 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:15,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,406 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:15,407 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-05-15 10:28:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:15,408 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:28:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:15,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:15,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:15,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:15,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-05-15 10:28:15,409 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-05-15 10:28:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:15,410 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-05-15 10:28:15,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-05-15 10:28:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-05-15 10:28:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-05-15 10:28:15,410 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:15,410 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-05-15 10:28:15,411 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash 915400962, now seen corresponding path program 11 times [2019-05-15 10:28:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,432 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-15 10:28:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:15,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:15,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:15,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:15,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_73|]. (= (store |v_#memory_int_73| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:15,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:15,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|]. (let ((.cse0 (select |v_#memory_int_74| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_74| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:15,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:15,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_75|]. (let ((.cse0 (select |v_#memory_int_75| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_75| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:15,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:15,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_76|]. (let ((.cse0 (select |v_#memory_int_76| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_76| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:15,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:15,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_77|]. (let ((.cse0 (select |v_#memory_int_77| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_77| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:15,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_78|]. (let ((.cse0 (select |v_#memory_int_78| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_78| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:15,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:15,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_79|]. (let ((.cse0 (select |v_#memory_int_79| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_79| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:15,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:15,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_80|]. (let ((.cse0 (select |v_#memory_int_80| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_80| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:15,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_81|]. (let ((.cse0 (select |v_#memory_int_81| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_81| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:15,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:15,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_82|]. (let ((.cse0 (select |v_#memory_int_82| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_82| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:15,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:15,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_83|]. (let ((.cse0 (select |v_#memory_int_83| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_83| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:15,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:15,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:15,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:15,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:15,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:15,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:15,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_84|]. (let ((.cse0 (select |v_#memory_int_84| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_84| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:15,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:15,967 INFO L273 TraceCheckUtils]: 0: Hoare triple {872#true} havoc main_p1; {872#true} is VALID [2019-05-15 10:28:15,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {872#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {872#true} is VALID [2019-05-15 10:28:15,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {872#true} #memory_int := #memory_int[main_p1 := 0]; {883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:15,969 INFO L273 TraceCheckUtils]: 3: Hoare triple {883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:15,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:15,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:15,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:15,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:15,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:15,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:15,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:15,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:15,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:15,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:15,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} assume !(#memory_int[main_p1] >= 0); {873#false} is VALID [2019-05-15 10:28:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:15,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:15,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-15 10:28:15,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-05-15 10:28:15,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:15,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2019-05-15 10:28:16,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:16,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-05-15 10:28:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-15 10:28:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-05-15 10:28:16,005 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 14 states. [2019-05-15 10:28:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,430 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-15 10:28:16,431 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-05-15 10:28:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-05-15 10:28:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-05-15 10:28:16,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 18 transitions. [2019-05-15 10:28:16,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:16,451 INFO L225 Difference]: With dead ends: 17 [2019-05-15 10:28:16,451 INFO L226 Difference]: Without dead ends: 17 [2019-05-15 10:28:16,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-05-15 10:28:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-05-15 10:28:16,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-05-15 10:28:16,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:16,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:16,454 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:16,454 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,455 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:16,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:16,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:16,456 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:16,456 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-05-15 10:28:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:16,457 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-05-15 10:28:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:16,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:16,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:16,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:16,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-05-15 10:28:16,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-05-15 10:28:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:16,459 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-05-15 10:28:16,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-05-15 10:28:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-05-15 10:28:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-05-15 10:28:16,459 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:16,460 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-05-15 10:28:16,460 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1687341304, now seen corresponding path program 12 times [2019-05-15 10:28:16,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:16,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-15 10:28:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:16,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:16,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:16,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:16,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_85|]. (= (store |v_#memory_int_85| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:16,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:16,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_86|]. (let ((.cse0 (select |v_#memory_int_86| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_86| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:16,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:16,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_87|]. (let ((.cse0 (select |v_#memory_int_87| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_87| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:28:16,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:16,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_88|]. (let ((.cse0 (select |v_#memory_int_88| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_88| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:16,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:16,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_89|]. (let ((.cse0 (select |v_#memory_int_89| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_89| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:16,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:16,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_90|]. (let ((.cse0 (select |v_#memory_int_90| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_90| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:16,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:16,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_91|]. (let ((.cse0 (select |v_#memory_int_91| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_91| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:16,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:16,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_92|]. (let ((.cse0 (select |v_#memory_int_92| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_92| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:16,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:16,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_93|]. (let ((.cse0 (select |v_#memory_int_93| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_93| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:16,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:16,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:16,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:16,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:16,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:16,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:16,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_94|]. (let ((.cse0 (select |v_#memory_int_94| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_94| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:16,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:17,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_95|]. (let ((.cse0 (select |v_#memory_int_95| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_95| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:17,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_96|]. (let ((.cse0 (select |v_#memory_int_96| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_96| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:17,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_97|]. (let ((.cse0 (select |v_#memory_int_97| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_97| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:17,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:17,145 INFO L273 TraceCheckUtils]: 0: Hoare triple {998#true} havoc main_p1; {998#true} is VALID [2019-05-15 10:28:17,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {998#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {998#true} is VALID [2019-05-15 10:28:17,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {998#true} #memory_int := #memory_int[main_p1 := 0]; {1009#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:17,147 INFO L273 TraceCheckUtils]: 3: Hoare triple {1009#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1013#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:17,148 INFO L273 TraceCheckUtils]: 4: Hoare triple {1013#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1017#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:17,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {1017#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1021#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:17,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {1021#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1025#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:17,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {1025#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1029#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:17,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {1029#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1033#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:17,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {1033#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1037#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:17,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {1037#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1041#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:17,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1045#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:17,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {1045#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1049#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:17,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {1049#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1053#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:17,181 INFO L273 TraceCheckUtils]: 14: Hoare triple {1053#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1057#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:17,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} assume !(#memory_int[main_p1] >= 0); {999#false} is VALID [2019-05-15 10:28:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:17,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:17,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-15 10:28:17,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-05-15 10:28:17,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:17,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2019-05-15 10:28:17,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:17,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-05-15 10:28:17,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-15 10:28:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-15 10:28:17,206 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 15 states. [2019-05-15 10:28:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,721 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:17,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-15 10:28:17,722 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2019-05-15 10:28:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-05-15 10:28:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:28:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-05-15 10:28:17,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 19 transitions. [2019-05-15 10:28:17,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:17,739 INFO L225 Difference]: With dead ends: 18 [2019-05-15 10:28:17,739 INFO L226 Difference]: Without dead ends: 18 [2019-05-15 10:28:17,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-05-15 10:28:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-05-15 10:28:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-05-15 10:28:17,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:17,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:17,742 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:17,742 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,743 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:17,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:17,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:17,743 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:17,743 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2019-05-15 10:28:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:17,744 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-05-15 10:28:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:17,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:17,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:17,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:17,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-05-15 10:28:17,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-05-15 10:28:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:17,746 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-05-15 10:28:17,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-05-15 10:28:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-05-15 10:28:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-05-15 10:28:17,746 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:17,747 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-05-15 10:28:17,747 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash -767972926, now seen corresponding path program 13 times [2019-05-15 10:28:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:17,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-15 10:28:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:17,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:17,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:17,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:17,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_98|]. (= (store |v_#memory_int_98| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:17,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:17,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_99|]. (let ((.cse0 (select |v_#memory_int_99| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_99| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:17,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:17,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_100|]. (let ((.cse0 (select |v_#memory_int_100| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_100| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:28:17,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:17,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_101|]. (let ((.cse0 (select |v_#memory_int_101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:17,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:17,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_102|]. (let ((.cse0 (select |v_#memory_int_102| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_102| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:17,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:17,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_103|]. (let ((.cse0 (select |v_#memory_int_103| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_103| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:28:17,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:17,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:17,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:17,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:17,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:17,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:17,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_104|]. (let ((.cse0 (select |v_#memory_int_104| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_104| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:17,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:17,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_105|]. (let ((.cse0 (select |v_#memory_int_105| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_105| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:18,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:18,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_106|]. (let ((.cse0 (select |v_#memory_int_106| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_106| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:18,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:18,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_107|]. (let ((.cse0 (select |v_#memory_int_107| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:18,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:18,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_108|]. (let ((.cse0 (select |v_#memory_int_108| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:18,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:18,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_109|]. (let ((.cse0 (select |v_#memory_int_109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:28:18,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:18,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_110|]. (let ((.cse0 (select |v_#memory_int_110| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:18,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:18,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:18,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:18,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:18,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:18,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:18,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_111|]. (let ((.cse0 (select |v_#memory_int_111| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:18,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:18,219 INFO L273 TraceCheckUtils]: 0: Hoare triple {1132#true} havoc main_p1; {1132#true} is VALID [2019-05-15 10:28:18,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1132#true} is VALID [2019-05-15 10:28:18,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} #memory_int := #memory_int[main_p1 := 0]; {1143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:18,220 INFO L273 TraceCheckUtils]: 3: Hoare triple {1143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:18,221 INFO L273 TraceCheckUtils]: 4: Hoare triple {1147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:18,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {1151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:18,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {1155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:18,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {1159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:18,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:18,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {1167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:18,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {1171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:18,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:18,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:18,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {1183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:18,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {1187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:18,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {1191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:18,232 INFO L273 TraceCheckUtils]: 16: Hoare triple {1195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} assume !(#memory_int[main_p1] >= 0); {1133#false} is VALID [2019-05-15 10:28:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:18,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:18,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-15 10:28:18,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-05-15 10:28:18,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:18,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-05-15 10:28:18,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:18,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-05-15 10:28:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-15 10:28:18,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:18,249 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-05-15 10:28:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,813 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-15 10:28:18,813 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-05-15 10:28:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-05-15 10:28:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-05-15 10:28:18,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 20 transitions. [2019-05-15 10:28:18,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:18,839 INFO L225 Difference]: With dead ends: 19 [2019-05-15 10:28:18,839 INFO L226 Difference]: Without dead ends: 19 [2019-05-15 10:28:18,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-05-15 10:28:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-05-15 10:28:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-05-15 10:28:18,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:18,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:18,844 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:18,844 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,845 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:18,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:18,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:18,846 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:18,846 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-05-15 10:28:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:18,847 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-05-15 10:28:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:18,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:18,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:18,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:18,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-05-15 10:28:18,849 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-05-15 10:28:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:18,849 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-05-15 10:28:18,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-05-15 10:28:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-05-15 10:28:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-05-15 10:28:18,850 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:18,850 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-05-15 10:28:18,851 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1962643016, now seen corresponding path program 14 times [2019-05-15 10:28:18,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:18,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-15 10:28:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:18,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:19,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:19,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:19,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_112|]. (= (store |v_#memory_int_112| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:19,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:19,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_113|]. (let ((.cse0 (select |v_#memory_int_113| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_113| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:19,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:19,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_114|]. (let ((.cse0 (select |v_#memory_int_114| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:19,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_115|]. (let ((.cse0 (select |v_#memory_int_115| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:19,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_116|]. (let ((.cse0 (select |v_#memory_int_116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:28:19,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:19,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_117|]. (let ((.cse0 (select |v_#memory_int_117| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_117| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:19,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:19,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,367 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_118|]. (let ((.cse0 (select |v_#memory_int_118| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_118| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:19,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:19,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_119|]. (let ((.cse0 (select |v_#memory_int_119| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:19,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_120|]. (let ((.cse0 (select |v_#memory_int_120| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_120| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:19,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:19,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_121|]. (let ((.cse0 (select |v_#memory_int_121| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_121| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:28:19,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:19,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_122|]. (let ((.cse0 (select |v_#memory_int_122| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:19,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:19,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_123|]. (let ((.cse0 (select |v_#memory_int_123| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_123| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:19,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:19,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_124|]. (let ((.cse0 (select |v_#memory_int_124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:19,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:19,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_125|]. (let ((.cse0 (select |v_#memory_int_125| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_125| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:28:19,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:19,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:19,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:19,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:19,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:19,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:19,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_126|]. (let ((.cse0 (select |v_#memory_int_126| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:19,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:19,631 INFO L273 TraceCheckUtils]: 0: Hoare triple {1274#true} havoc main_p1; {1274#true} is VALID [2019-05-15 10:28:19,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1274#true} is VALID [2019-05-15 10:28:19,632 INFO L273 TraceCheckUtils]: 2: Hoare triple {1274#true} #memory_int := #memory_int[main_p1 := 0]; {1285#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:19,633 INFO L273 TraceCheckUtils]: 3: Hoare triple {1285#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1289#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:19,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {1289#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1293#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:19,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {1293#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1297#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:19,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {1297#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1301#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:19,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {1301#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1305#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:19,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1309#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:19,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {1309#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1313#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:19,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {1313#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1317#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:19,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {1317#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1321#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:19,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {1321#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1325#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:19,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {1325#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1329#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:19,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {1329#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1333#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:19,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {1333#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1337#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:19,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {1337#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1341#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:19,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {1341#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} assume !(#memory_int[main_p1] >= 0); {1275#false} is VALID [2019-05-15 10:28:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:19,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:19,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-15 10:28:19,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-05-15 10:28:19,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:19,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2019-05-15 10:28:19,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:19,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-05-15 10:28:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-15 10:28:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-15 10:28:19,664 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 17 states. [2019-05-15 10:28:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,236 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-15 10:28:20,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2019-05-15 10:28:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-05-15 10:28:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-05-15 10:28:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-05-15 10:28:20,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2019-05-15 10:28:20,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:20,259 INFO L225 Difference]: With dead ends: 20 [2019-05-15 10:28:20,259 INFO L226 Difference]: Without dead ends: 20 [2019-05-15 10:28:20,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-05-15 10:28:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-05-15 10:28:20,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-05-15 10:28:20,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:20,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:20,262 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:20,262 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,263 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:20,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,264 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:20,264 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-05-15 10:28:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:20,264 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:28:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:20,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:20,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:20,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:20,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-05-15 10:28:20,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-05-15 10:28:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:20,266 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-05-15 10:28:20,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-05-15 10:28:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:28:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-05-15 10:28:20,267 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:20,267 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-05-15 10:28:20,267 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:20,268 INFO L82 PathProgramCache]: Analyzing trace with hash 712391298, now seen corresponding path program 15 times [2019-05-15 10:28:20,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-15 10:28:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:20,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:20,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:20,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:20,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_127|]. (= |#memory_int| (store |v_#memory_int_127| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:20,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:20,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_128|]. (let ((.cse0 (select |v_#memory_int_128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:20,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:20,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_129|]. (let ((.cse0 (select |v_#memory_int_129| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:20,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_130|]. (let ((.cse0 (select |v_#memory_int_130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:28:20,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:20,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_131|]. (let ((.cse0 (select |v_#memory_int_131| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:20,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_132|]. (let ((.cse0 (select |v_#memory_int_132| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_132| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:20,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:20,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_133|]. (let ((.cse0 (select |v_#memory_int_133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:20,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:20,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_134|]. (let ((.cse0 (select |v_#memory_int_134| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_134| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:20,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_135|]. (let ((.cse0 (select |v_#memory_int_135| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:20,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,689 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,689 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_136|]. (let ((.cse0 (select |v_#memory_int_136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:28:20,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:20,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_137|]. (let ((.cse0 (select |v_#memory_int_137| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_137| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:20,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_138|]. (let ((.cse0 (select |v_#memory_int_138| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_138| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:20,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_139|]. (let ((.cse0 (select |v_#memory_int_139| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_139| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:20,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:20,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_140|]. (let ((.cse0 (select |v_#memory_int_140| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:20,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:20,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_141|]. (let ((.cse0 (select |v_#memory_int_141| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_141| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:28:20,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:20,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:20,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:20,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:20,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:20,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:20,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_142|]. (let ((.cse0 (select |v_#memory_int_142| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:20,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:20,901 INFO L273 TraceCheckUtils]: 0: Hoare triple {1424#true} havoc main_p1; {1424#true} is VALID [2019-05-15 10:28:20,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {1424#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1424#true} is VALID [2019-05-15 10:28:20,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {1424#true} #memory_int := #memory_int[main_p1 := 0]; {1435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:20,903 INFO L273 TraceCheckUtils]: 3: Hoare triple {1435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:20,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {1439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:20,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {1443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:20,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {1447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:20,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {1451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:20,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {1455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:20,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {1459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:20,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {1463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:20,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {1467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:20,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {1471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:20,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {1475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:20,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {1479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:20,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {1483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:20,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:20,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {1491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:20,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} assume !(#memory_int[main_p1] >= 0); {1425#false} is VALID [2019-05-15 10:28:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:20,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:20,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-15 10:28:20,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-05-15 10:28:20,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:20,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2019-05-15 10:28:20,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:20,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-05-15 10:28:20,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-15 10:28:20,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:20,958 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 18 states. [2019-05-15 10:28:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,600 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:21,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-15 10:28:21,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2019-05-15 10:28:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-05-15 10:28:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-05-15 10:28:21,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 22 transitions. [2019-05-15 10:28:21,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:21,625 INFO L225 Difference]: With dead ends: 21 [2019-05-15 10:28:21,625 INFO L226 Difference]: Without dead ends: 21 [2019-05-15 10:28:21,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-05-15 10:28:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-05-15 10:28:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-05-15 10:28:21,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:21,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:21,628 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:21,629 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,629 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:21,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:21,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:21,630 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:21,630 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-05-15 10:28:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:21,631 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-05-15 10:28:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:21,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:21,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:21,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:21,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-15 10:28:21,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-05-15 10:28:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:21,633 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-05-15 10:28:21,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-05-15 10:28:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:28:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-05-15 10:28:21,633 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:21,633 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-05-15 10:28:21,634 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 609293704, now seen corresponding path program 16 times [2019-05-15 10:28:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:21,656 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-15 10:28:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:21,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:21,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:21,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:21,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_143|]. (= |#memory_int| (store |v_#memory_int_143| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:21,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:21,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_144|]. (let ((.cse0 (select |v_#memory_int_144| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:21,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_145|]. (let ((.cse0 (select |v_#memory_int_145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:21,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:21,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_146|]. (let ((.cse0 (select |v_#memory_int_146| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:21,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,924 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_147|]. (let ((.cse0 (select |v_#memory_int_147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:28:21,924 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:21,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:21,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:21,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:21,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:21,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:21,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_148|]. (let ((.cse0 (select |v_#memory_int_148| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:21,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:22,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_149|]. (let ((.cse0 (select |v_#memory_int_149| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_149| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:22,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:22,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_150|]. (let ((.cse0 (select |v_#memory_int_150| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:22,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:22,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_151|]. (let ((.cse0 (select |v_#memory_int_151| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_151| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:22,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:22,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_152|]. (let ((.cse0 (select |v_#memory_int_152| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_152| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:22,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_153|]. (let ((.cse0 (select |v_#memory_int_153| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_153| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:22,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,195 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_154|]. (let ((.cse0 (select |v_#memory_int_154| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_154| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:22,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_155|]. (let ((.cse0 (select |v_#memory_int_155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:22,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:22,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_156|]. (let ((.cse0 (select |v_#memory_int_156| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_156| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:22,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:22,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_157|]. (let ((.cse0 (select |v_#memory_int_157| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:28:22,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:22,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,367 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_158|]. (let ((.cse0 (select |v_#memory_int_158| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_158| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:22,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:22,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:22,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:22,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:22,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:22,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_159|]. (let ((.cse0 (select |v_#memory_int_159| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:22,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:22,417 INFO L273 TraceCheckUtils]: 0: Hoare triple {1582#true} havoc main_p1; {1582#true} is VALID [2019-05-15 10:28:22,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {1582#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1582#true} is VALID [2019-05-15 10:28:22,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {1582#true} #memory_int := #memory_int[main_p1 := 0]; {1593#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:22,420 INFO L273 TraceCheckUtils]: 3: Hoare triple {1593#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1597#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:22,420 INFO L273 TraceCheckUtils]: 4: Hoare triple {1597#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1601#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:22,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1601#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1605#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:22,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {1605#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1609#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:22,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {1609#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1613#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:22,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {1613#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1617#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:22,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1617#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1621#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:22,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {1621#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1625#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:22,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {1625#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1629#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:22,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {1629#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1633#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:22,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {1633#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1637#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:22,428 INFO L273 TraceCheckUtils]: 14: Hoare triple {1637#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1641#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:22,429 INFO L273 TraceCheckUtils]: 15: Hoare triple {1641#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1645#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:22,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {1645#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1649#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:22,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {1649#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1653#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:22,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {1653#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1657#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:22,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {1657#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} assume !(#memory_int[main_p1] >= 0); {1583#false} is VALID [2019-05-15 10:28:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:22,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:22,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-15 10:28:22,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-05-15 10:28:22,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:22,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2019-05-15 10:28:22,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:22,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-05-15 10:28:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-15 10:28:22,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-15 10:28:22,454 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 19 states. [2019-05-15 10:28:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:23,175 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-15 10:28:23,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-05-15 10:28:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-05-15 10:28:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-05-15 10:28:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-05-15 10:28:23,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2019-05-15 10:28:23,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:23,205 INFO L225 Difference]: With dead ends: 22 [2019-05-15 10:28:23,205 INFO L226 Difference]: Without dead ends: 22 [2019-05-15 10:28:23,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-05-15 10:28:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-05-15 10:28:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-05-15 10:28:23,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:23,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:23,208 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:23,208 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:23,209 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:23,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:23,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:23,209 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:23,209 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2019-05-15 10:28:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:23,210 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-05-15 10:28:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:23,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:23,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:23,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:23,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-05-15 10:28:23,211 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-05-15 10:28:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:23,211 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-05-15 10:28:23,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-05-15 10:28:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-05-15 10:28:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-05-15 10:28:23,212 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:23,212 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-05-15 10:28:23,212 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1708235586, now seen corresponding path program 17 times [2019-05-15 10:28:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:23,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-15 10:28:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:23,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:23,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:23,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_160|]. (= (store |v_#memory_int_160| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:23,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:23,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_161|]. (let ((.cse0 (select |v_#memory_int_161| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:23,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_162|]. (let ((.cse0 (select |v_#memory_int_162| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:23,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_163|]. (let ((.cse0 (select |v_#memory_int_163| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_163| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:23,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:23,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_164|]. (let ((.cse0 (select |v_#memory_int_164| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:23,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:23,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_165|]. (let ((.cse0 (select |v_#memory_int_165| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:23,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_166|]. (let ((.cse0 (select |v_#memory_int_166| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_166| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:23,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_167|]. (let ((.cse0 (select |v_#memory_int_167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:23,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:23,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_168|]. (let ((.cse0 (select |v_#memory_int_168| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:23,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_169|]. (let ((.cse0 (select |v_#memory_int_169| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:23,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_170|]. (let ((.cse0 (select |v_#memory_int_170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:28:23,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:23,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_171|]. (let ((.cse0 (select |v_#memory_int_171| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,609 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:23,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_172|]. (let ((.cse0 (select |v_#memory_int_172| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:23,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_173|]. (let ((.cse0 (select |v_#memory_int_173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:23,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:23,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_174|]. (let ((.cse0 (select |v_#memory_int_174| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:23,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_175|]. (let ((.cse0 (select |v_#memory_int_175| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:23,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:23,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_176|]. (let ((.cse0 (select |v_#memory_int_176| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_176| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:23,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:23,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:23,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:23,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:23,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:23,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:23,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_177|]. (let ((.cse0 (select |v_#memory_int_177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:23,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:23,898 INFO L273 TraceCheckUtils]: 0: Hoare triple {1748#true} havoc main_p1; {1748#true} is VALID [2019-05-15 10:28:23,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {1748#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1748#true} is VALID [2019-05-15 10:28:23,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {1748#true} #memory_int := #memory_int[main_p1 := 0]; {1759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:23,907 INFO L273 TraceCheckUtils]: 3: Hoare triple {1759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:23,908 INFO L273 TraceCheckUtils]: 4: Hoare triple {1763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:23,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {1767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:23,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {1771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:23,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {1775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:23,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {1779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:23,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:23,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {1787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:23,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {1791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:23,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {1795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:23,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {1799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:23,916 INFO L273 TraceCheckUtils]: 14: Hoare triple {1803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:23,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {1807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:23,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {1811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:23,918 INFO L273 TraceCheckUtils]: 17: Hoare triple {1815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:23,919 INFO L273 TraceCheckUtils]: 18: Hoare triple {1819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:23,920 INFO L273 TraceCheckUtils]: 19: Hoare triple {1823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:23,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {1827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} assume !(#memory_int[main_p1] >= 0); {1749#false} is VALID [2019-05-15 10:28:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-15 10:28:23,923 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-05-15 10:28:23,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:23,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2019-05-15 10:28:23,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:23,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-05-15 10:28:23,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-15 10:28:23,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:23,943 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 20 states. [2019-05-15 10:28:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,796 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-15 10:28:24,797 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-05-15 10:28:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-05-15 10:28:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-05-15 10:28:24,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2019-05-15 10:28:24,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:24,822 INFO L225 Difference]: With dead ends: 23 [2019-05-15 10:28:24,822 INFO L226 Difference]: Without dead ends: 23 [2019-05-15 10:28:24,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-05-15 10:28:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-05-15 10:28:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-05-15 10:28:24,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:24,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:24,826 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:24,826 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,827 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:24,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:24,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:24,827 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:24,827 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-05-15 10:28:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:24,828 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-05-15 10:28:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:24,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:24,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:24,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:24,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-05-15 10:28:24,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-05-15 10:28:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:24,830 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-05-15 10:28:24,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-05-15 10:28:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-05-15 10:28:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-05-15 10:28:24,831 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:24,831 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-05-15 10:28:24,831 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:24,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1415695560, now seen corresponding path program 18 times [2019-05-15 10:28:24,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:24,854 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-15 10:28:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:24,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:24,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:24,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:24,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_178|]. (= (store |v_#memory_int_178| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:24,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:24,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_179|]. (let ((.cse0 (select |v_#memory_int_179| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_179| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:24,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:24,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,950 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_180|]. (let ((.cse0 (select |v_#memory_int_180| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_180| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:24,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:24,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_181|]. (let ((.cse0 (select |v_#memory_int_181| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_181| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:24,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:24,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:24,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:24,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:24,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:24,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:24,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_182|]. (let ((.cse0 (select |v_#memory_int_182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:24,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:25,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_183|]. (let ((.cse0 (select |v_#memory_int_183| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_183| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:28:25,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:25,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_184|]. (let ((.cse0 (select |v_#memory_int_184| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_184| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:25,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_185|]. (let ((.cse0 (select |v_#memory_int_185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:25,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:25,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_186|]. (let ((.cse0 (select |v_#memory_int_186| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_186| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:25,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_187|]. (let ((.cse0 (select |v_#memory_int_187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:25,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:25,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,156 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_188|]. (let ((.cse0 (select |v_#memory_int_188| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:25,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:25,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,187 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,187 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_189|]. (let ((.cse0 (select |v_#memory_int_189| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_189| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:25,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_190|]. (let ((.cse0 (select |v_#memory_int_190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:25,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:25,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_191|]. (let ((.cse0 (select |v_#memory_int_191| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_191| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:25,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:25,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_192|]. (let ((.cse0 (select |v_#memory_int_192| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_192| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:25,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_193|]. (let ((.cse0 (select |v_#memory_int_193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:25,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:25,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_194|]. (let ((.cse0 (select |v_#memory_int_194| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:25,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:25,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_195|]. (let ((.cse0 (select |v_#memory_int_195| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:25,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:25,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:25,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:25,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:25,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:25,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:25,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_196|]. (let ((.cse0 (select |v_#memory_int_196| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= |#memory_int| (store |v_#memory_int_196| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:25,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:25,495 INFO L273 TraceCheckUtils]: 0: Hoare triple {1922#true} havoc main_p1; {1922#true} is VALID [2019-05-15 10:28:25,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {1922#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {1922#true} is VALID [2019-05-15 10:28:25,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {1922#true} #memory_int := #memory_int[main_p1 := 0]; {1933#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:25,496 INFO L273 TraceCheckUtils]: 3: Hoare triple {1933#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1937#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:25,497 INFO L273 TraceCheckUtils]: 4: Hoare triple {1937#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1941#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:25,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {1941#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1945#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:25,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {1945#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1949#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:25,500 INFO L273 TraceCheckUtils]: 7: Hoare triple {1949#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1953#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:25,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {1953#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1957#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:25,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {1957#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1961#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:25,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {1961#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1965#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:25,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {1965#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1969#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:25,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {1969#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1973#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:25,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {1973#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1977#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:25,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {1977#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1981#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:25,508 INFO L273 TraceCheckUtils]: 15: Hoare triple {1981#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1985#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:25,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {1985#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1989#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:25,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {1989#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1993#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:25,511 INFO L273 TraceCheckUtils]: 18: Hoare triple {1993#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1997#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:25,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {1997#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2001#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:25,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {2001#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2005#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:25,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {2005#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} assume !(#memory_int[main_p1] >= 0); {1923#false} is VALID [2019-05-15 10:28:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:25,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:25,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-15 10:28:25,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-05-15 10:28:25,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:25,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2019-05-15 10:28:25,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:25,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-05-15 10:28:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-15 10:28:25,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-15 10:28:25,543 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 21 states. [2019-05-15 10:28:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:26,429 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-15 10:28:26,430 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-05-15 10:28:26,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-05-15 10:28:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:28:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-05-15 10:28:26,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2019-05-15 10:28:26,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:26,453 INFO L225 Difference]: With dead ends: 24 [2019-05-15 10:28:26,453 INFO L226 Difference]: Without dead ends: 24 [2019-05-15 10:28:26,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-05-15 10:28:26,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-05-15 10:28:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-05-15 10:28:26,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:26,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:26,456 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:26,456 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:26,457 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:26,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:26,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:26,457 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:26,457 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-05-15 10:28:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:26,458 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-05-15 10:28:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:26,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:26,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:26,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:26,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-05-15 10:28:26,459 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-05-15 10:28:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:26,459 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-05-15 10:28:26,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-05-15 10:28:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-05-15 10:28:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-05-15 10:28:26,459 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:26,460 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-05-15 10:28:26,460 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash 936889346, now seen corresponding path program 19 times [2019-05-15 10:28:26,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:26,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-15 10:28:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:26,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:26,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:26,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:26,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_197|]. (= |#memory_int| (store |v_#memory_int_197| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:26,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:26,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_198|]. (let ((.cse0 (select |v_#memory_int_198| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_198| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:28:26,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:26,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_199|]. (let ((.cse0 (select |v_#memory_int_199| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_199| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:26,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:26,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_200|]. (let ((.cse0 (select |v_#memory_int_200| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_200| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:26,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_201|]. (let ((.cse0 (select |v_#memory_int_201| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:26,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_202|]. (let ((.cse0 (select |v_#memory_int_202| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:26,686 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:26,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_203|]. (let ((.cse0 (select |v_#memory_int_203| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_203| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:26,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:26,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_204|]. (let ((.cse0 (select |v_#memory_int_204| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_204| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:26,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:26,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,762 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_205|]. (let ((.cse0 (select |v_#memory_int_205| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:26,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_206|]. (let ((.cse0 (select |v_#memory_int_206| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_206| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:26,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_207|]. (let ((.cse0 (select |v_#memory_int_207| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:28:26,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:26,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_208|]. (let ((.cse0 (select |v_#memory_int_208| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:26,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:26,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:26,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:26,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:26,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:26,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:26,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_209|]. (let ((.cse0 (select |v_#memory_int_209| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_209| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:26,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:27,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,070 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_210|]. (let ((.cse0 (select |v_#memory_int_210| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_210| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:28:27,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:27,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_211|]. (let ((.cse0 (select |v_#memory_int_211| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= |#memory_int| (store |v_#memory_int_211| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:27,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_212|]. (let ((.cse0 (select |v_#memory_int_212| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:27,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:27,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_213|]. (let ((.cse0 (select |v_#memory_int_213| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:27,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:27,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_214|]. (let ((.cse0 (select |v_#memory_int_214| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_214| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:27,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:27,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_215|]. (let ((.cse0 (select |v_#memory_int_215| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_215| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:28:27,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:27,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:27,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:27,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:27,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:27,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:27,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_216|]. (let ((.cse0 (select |v_#memory_int_216| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_216| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:27,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:27,424 INFO L273 TraceCheckUtils]: 0: Hoare triple {2104#true} havoc main_p1; {2104#true} is VALID [2019-05-15 10:28:27,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {2104#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2104#true} is VALID [2019-05-15 10:28:27,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {2104#true} #memory_int := #memory_int[main_p1 := 0]; {2115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:27,427 INFO L273 TraceCheckUtils]: 3: Hoare triple {2115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:27,428 INFO L273 TraceCheckUtils]: 4: Hoare triple {2119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:27,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {2123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:27,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {2127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:27,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {2131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:27,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {2135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:27,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {2139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:27,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:27,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:27,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {2151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:27,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {2155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:27,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {2159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:27,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {2163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:27,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {2167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:27,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {2171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:27,439 INFO L273 TraceCheckUtils]: 18: Hoare triple {2175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:27,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {2179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:27,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {2183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:27,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {2187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:27,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {2191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} assume !(#memory_int[main_p1] >= 0); {2105#false} is VALID [2019-05-15 10:28:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:27,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:27,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-15 10:28:27,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-05-15 10:28:27,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:27,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2019-05-15 10:28:27,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:27,466 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-05-15 10:28:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-15 10:28:27,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:27,466 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 22 states. [2019-05-15 10:28:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:28,415 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-15 10:28:28,416 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-05-15 10:28:28,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-05-15 10:28:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-05-15 10:28:28,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2019-05-15 10:28:28,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:28,438 INFO L225 Difference]: With dead ends: 25 [2019-05-15 10:28:28,438 INFO L226 Difference]: Without dead ends: 25 [2019-05-15 10:28:28,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-05-15 10:28:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-05-15 10:28:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-05-15 10:28:28,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:28,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:28,441 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:28,441 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:28,442 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:28,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:28,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:28,443 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:28,443 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-05-15 10:28:28,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:28,443 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-05-15 10:28:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:28,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:28,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:28,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:28,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-05-15 10:28:28,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-05-15 10:28:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:28,445 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-05-15 10:28:28,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-05-15 10:28:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-05-15 10:28:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-05-15 10:28:28,446 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:28,446 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-05-15 10:28:28,446 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:28,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1021201400, now seen corresponding path program 20 times [2019-05-15 10:28:28,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:28,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-15 10:28:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:28,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:28,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:28,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:28,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_217|]. (= (store |v_#memory_int_217| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:28,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:28,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_218|]. (let ((.cse0 (select |v_#memory_int_218| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:28,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_219|]. (let ((.cse0 (select |v_#memory_int_219| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:28,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:28,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_220|]. (let ((.cse0 (select |v_#memory_int_220| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_220| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:28,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_221|]. (let ((.cse0 (select |v_#memory_int_221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:28,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:28,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_222|]. (let ((.cse0 (select |v_#memory_int_222| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_222| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:28,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_223|]. (let ((.cse0 (select |v_#memory_int_223| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_223| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:28,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:28,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_224|]. (let ((.cse0 (select |v_#memory_int_224| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:28,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:28,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_225|]. (let ((.cse0 (select |v_#memory_int_225| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_225| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:28,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:28,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_226|]. (let ((.cse0 (select |v_#memory_int_226| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:28:28,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:28,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_227|]. (let ((.cse0 (select |v_#memory_int_227| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_227| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:28,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:28,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_228|]. (let ((.cse0 (select |v_#memory_int_228| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_228| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:28,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:28,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_229|]. (let ((.cse0 (select |v_#memory_int_229| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_229| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:28,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:28,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,908 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,908 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_230|]. (let ((.cse0 (select |v_#memory_int_230| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_230| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:28:28,908 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:28,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_231|]. (let ((.cse0 (select |v_#memory_int_231| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:28,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:28,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:28,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:28,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_232|]. (let ((.cse0 (select |v_#memory_int_232| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_232| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:28:28,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:28,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:28,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:28,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:28,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_233|]. (let ((.cse0 (select |v_#memory_int_233| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_233| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:29,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:29,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_234|]. (let ((.cse0 (select |v_#memory_int_234| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_234| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:29,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:29,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_235|]. (let ((.cse0 (select |v_#memory_int_235| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:29,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_236|]. (let ((.cse0 (select |v_#memory_int_236| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:29,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:29,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:29,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:29,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:29,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:29,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:29,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_237|]. (let ((.cse0 (select |v_#memory_int_237| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_237| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:29,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:29,247 INFO L273 TraceCheckUtils]: 0: Hoare triple {2294#true} havoc main_p1; {2294#true} is VALID [2019-05-15 10:28:29,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {2294#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2294#true} is VALID [2019-05-15 10:28:29,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {2294#true} #memory_int := #memory_int[main_p1 := 0]; {2305#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:29,250 INFO L273 TraceCheckUtils]: 3: Hoare triple {2305#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2309#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:29,250 INFO L273 TraceCheckUtils]: 4: Hoare triple {2309#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2313#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:29,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {2313#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2317#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:29,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {2317#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2321#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:29,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {2321#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2325#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:29,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {2325#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2329#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:29,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {2329#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2333#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:29,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {2333#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2337#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:29,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {2337#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2341#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:29,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2345#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:29,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {2345#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2349#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:29,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {2349#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2353#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:29,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {2353#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2357#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:29,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {2357#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2361#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:29,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {2361#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2365#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:29,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {2365#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2369#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:29,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {2369#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2373#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:29,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {2373#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2377#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:29,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {2377#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2381#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:29,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {2381#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2385#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:29,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {2385#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} assume !(#memory_int[main_p1] >= 0); {2295#false} is VALID [2019-05-15 10:28:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:29,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-15 10:28:29,268 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-05-15 10:28:29,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:29,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2019-05-15 10:28:29,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:29,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-05-15 10:28:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-15 10:28:29,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-05-15 10:28:29,291 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 23 states. [2019-05-15 10:28:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:30,593 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:30,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-15 10:28:30,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2019-05-15 10:28:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-05-15 10:28:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-05-15 10:28:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-05-15 10:28:30,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2019-05-15 10:28:30,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:30,618 INFO L225 Difference]: With dead ends: 26 [2019-05-15 10:28:30,618 INFO L226 Difference]: Without dead ends: 26 [2019-05-15 10:28:30,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-05-15 10:28:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-05-15 10:28:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-05-15 10:28:30,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:30,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:30,621 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:30,621 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:30,622 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:30,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:30,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:30,623 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:30,623 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-05-15 10:28:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:30,624 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:28:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:30,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:30,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:30,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:30,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-05-15 10:28:30,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-05-15 10:28:30,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:30,625 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-05-15 10:28:30,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-05-15 10:28:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:28:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-05-15 10:28:30,626 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:30,626 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-05-15 10:28:30,626 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1592472382, now seen corresponding path program 21 times [2019-05-15 10:28:30,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:30,640 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-15 10:28:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:30,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:30,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:30,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:30,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:30,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_238|]. (= (store |v_#memory_int_238| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:30,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:30,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:30,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:30,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:30,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_239|]. (let ((.cse0 (select |v_#memory_int_239| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:30,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:30,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:30,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:30,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:30,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:30,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:30,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_240|]. (let ((.cse0 (select |v_#memory_int_240| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:30,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:31,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_241|]. (let ((.cse0 (select |v_#memory_int_241| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_241| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:31,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:31,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_242|]. (let ((.cse0 (select |v_#memory_int_242| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_242| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:31,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:31,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_243|]. (let ((.cse0 (select |v_#memory_int_243| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_243| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:31,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_244|]. (let ((.cse0 (select |v_#memory_int_244| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:31,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_245|]. (let ((.cse0 (select |v_#memory_int_245| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_245| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:31,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_246|]. (let ((.cse0 (select |v_#memory_int_246| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:28:31,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:31,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_247|]. (let ((.cse0 (select |v_#memory_int_247| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:31,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:31,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_248|]. (let ((.cse0 (select |v_#memory_int_248| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_248| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:31,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:31,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_249|]. (let ((.cse0 (select |v_#memory_int_249| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_249| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,822 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:31,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_250|]. (let ((.cse0 (select |v_#memory_int_250| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_250| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:28:31,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:31,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_251|]. (let ((.cse0 (select |v_#memory_int_251| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:31,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:31,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:31,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:31,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:31,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:31,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:31,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_252|]. (let ((.cse0 (select |v_#memory_int_252| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_252| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:31,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:32,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_253|]. (let ((.cse0 (select |v_#memory_int_253| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:32,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:32,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_254|]. (let ((.cse0 (select |v_#memory_int_254| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_254| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:28:32,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:32,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_255|]. (let ((.cse0 (select |v_#memory_int_255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:32,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:32,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_256|]. (let ((.cse0 (select |v_#memory_int_256| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_256| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:32,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:32,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,252 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_257|]. (let ((.cse0 (select |v_#memory_int_257| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:32,252 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:32,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,289 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_258|]. (let ((.cse0 (select |v_#memory_int_258| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_258| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:32,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:32,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:32,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:32,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:32,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:32,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:32,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_259|]. (let ((.cse0 (select |v_#memory_int_259| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:32,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:32,363 INFO L273 TraceCheckUtils]: 0: Hoare triple {2492#true} havoc main_p1; {2492#true} is VALID [2019-05-15 10:28:32,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {2492#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2492#true} is VALID [2019-05-15 10:28:32,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {2492#true} #memory_int := #memory_int[main_p1 := 0]; {2503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:32,365 INFO L273 TraceCheckUtils]: 3: Hoare triple {2503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:32,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {2507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:32,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {2511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:32,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {2515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:32,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {2519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:32,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {2523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:32,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {2527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:32,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:32,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:32,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {2539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:32,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {2543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:32,375 INFO L273 TraceCheckUtils]: 14: Hoare triple {2547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:32,376 INFO L273 TraceCheckUtils]: 15: Hoare triple {2551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:32,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:32,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:32,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {2563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:32,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {2567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:32,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {2571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:32,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {2575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:32,379 INFO L273 TraceCheckUtils]: 22: Hoare triple {2579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:32,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {2583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:32,380 INFO L273 TraceCheckUtils]: 24: Hoare triple {2587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} assume !(#memory_int[main_p1] >= 0); {2493#false} is VALID [2019-05-15 10:28:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:32,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:32,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-15 10:28:32,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-05-15 10:28:32,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:32,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2019-05-15 10:28:32,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:32,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-05-15 10:28:32,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-15 10:28:32,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:32,410 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 24 states. [2019-05-15 10:28:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,652 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-15 10:28:33,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-05-15 10:28:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-05-15 10:28:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-05-15 10:28:33,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2019-05-15 10:28:33,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:33,687 INFO L225 Difference]: With dead ends: 27 [2019-05-15 10:28:33,687 INFO L226 Difference]: Without dead ends: 27 [2019-05-15 10:28:33,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-05-15 10:28:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-05-15 10:28:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-05-15 10:28:33,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:33,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:33,690 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:33,690 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,691 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:33,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:33,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:33,691 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:33,691 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-05-15 10:28:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:33,692 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-05-15 10:28:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:33,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:33,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:33,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:33,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-15 10:28:33,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-05-15 10:28:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:33,694 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-05-15 10:28:33,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-05-15 10:28:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:28:33,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-05-15 10:28:33,694 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:33,695 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-05-15 10:28:33,695 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:33,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:33,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2122003640, now seen corresponding path program 22 times [2019-05-15 10:28:33,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:33,708 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-15 10:28:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:33,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:33,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:33,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_260|]. (= |#memory_int| (store |v_#memory_int_260| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:33,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:33,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_261|]. (let ((.cse0 (select |v_#memory_int_261| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_261| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:33,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:33,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_262|]. (let ((.cse0 (select |v_#memory_int_262| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_262| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:33,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:33,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,839 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_263|]. (let ((.cse0 (select |v_#memory_int_263| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:33,839 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:33,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_264|]. (let ((.cse0 (select |v_#memory_int_264| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_264| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:28:33,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:33,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:33,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:33,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_265|]. (let ((.cse0 (select |v_#memory_int_265| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_265| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:33,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:33,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:33,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:33,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:33,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_266|]. (let ((.cse0 (select |v_#memory_int_266| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:34,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_267|]. (let ((.cse0 (select |v_#memory_int_267| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:28:34,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:34,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_268|]. (let ((.cse0 (select |v_#memory_int_268| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:28:34,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:34,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_269|]. (let ((.cse0 (select |v_#memory_int_269| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_269| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:34,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_270|]. (let ((.cse0 (select |v_#memory_int_270| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_270| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:28:34,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:34,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_271|]. (let ((.cse0 (select |v_#memory_int_271| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_271| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:34,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_272|]. (let ((.cse0 (select |v_#memory_int_272| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:34,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_273|]. (let ((.cse0 (select |v_#memory_int_273| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:34,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_274|]. (let ((.cse0 (select |v_#memory_int_274| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:34,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_275|]. (let ((.cse0 (select |v_#memory_int_275| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_275| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:34,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_276|]. (let ((.cse0 (select |v_#memory_int_276| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:34,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_277|]. (let ((.cse0 (select |v_#memory_int_277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:28:34,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:34,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_278|]. (let ((.cse0 (select |v_#memory_int_278| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_278| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:28:34,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:34,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_279|]. (let ((.cse0 (select |v_#memory_int_279| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_279| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:34,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:34,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_280|]. (let ((.cse0 (select |v_#memory_int_280| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_280| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:34,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_281|]. (let ((.cse0 (select |v_#memory_int_281| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_281| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:34,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:34,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:34,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:34,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:34,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:34,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:34,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_282|]. (let ((.cse0 (select |v_#memory_int_282| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_282| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:34,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:34,557 INFO L273 TraceCheckUtils]: 0: Hoare triple {2698#true} havoc main_p1; {2698#true} is VALID [2019-05-15 10:28:34,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {2698#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2698#true} is VALID [2019-05-15 10:28:34,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {2698#true} #memory_int := #memory_int[main_p1 := 0]; {2709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:34,559 INFO L273 TraceCheckUtils]: 3: Hoare triple {2709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:34,559 INFO L273 TraceCheckUtils]: 4: Hoare triple {2713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:34,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {2717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:34,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {2721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:34,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {2725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:34,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {2729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:34,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {2733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:34,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {2737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:34,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {2741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:34,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {2745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:34,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {2749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:34,567 INFO L273 TraceCheckUtils]: 14: Hoare triple {2753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:34,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {2757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:34,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {2761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:34,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {2765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:34,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {2769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:34,571 INFO L273 TraceCheckUtils]: 19: Hoare triple {2773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:34,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {2777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:34,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {2781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:34,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {2785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:34,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {2789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:34,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {2793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:34,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {2797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} assume !(#memory_int[main_p1] >= 0); {2699#false} is VALID [2019-05-15 10:28:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:34,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:34,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-15 10:28:34,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-05-15 10:28:34,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:34,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2019-05-15 10:28:34,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:34,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-05-15 10:28:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-15 10:28:34,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-05-15 10:28:34,625 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 25 states. [2019-05-15 10:28:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,397 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-15 10:28:36,398 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2019-05-15 10:28:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-05-15 10:28:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-05-15 10:28:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-05-15 10:28:36,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2019-05-15 10:28:36,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:36,701 INFO L225 Difference]: With dead ends: 28 [2019-05-15 10:28:36,701 INFO L226 Difference]: Without dead ends: 28 [2019-05-15 10:28:36,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-05-15 10:28:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-05-15 10:28:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-05-15 10:28:36,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:36,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:36,704 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:36,704 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,705 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:36,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:36,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:36,706 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:36,706 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-05-15 10:28:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:36,706 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-05-15 10:28:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:36,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:36,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:36,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:36,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-05-15 10:28:36,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-05-15 10:28:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:36,708 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-05-15 10:28:36,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-05-15 10:28:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-05-15 10:28:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-05-15 10:28:36,708 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:36,708 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-05-15 10:28:36,709 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:36,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1357603454, now seen corresponding path program 23 times [2019-05-15 10:28:36,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:36,723 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-15 10:28:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:36,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:36,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:36,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:36,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_283|]. (= (store |v_#memory_int_283| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:36,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:36,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_284|]. (let ((.cse0 (select |v_#memory_int_284| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:36,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:36,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_285|]. (let ((.cse0 (select |v_#memory_int_285| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_285| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:36,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:36,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_286|]. (let ((.cse0 (select |v_#memory_int_286| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:36,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:36,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,881 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,881 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_287|]. (let ((.cse0 (select |v_#memory_int_287| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_287| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:36,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:36,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_288|]. (let ((.cse0 (select |v_#memory_int_288| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:28:36,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:36,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_289|]. (let ((.cse0 (select |v_#memory_int_289| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_289| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:28:36,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:36,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_290|]. (let ((.cse0 (select |v_#memory_int_290| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_290| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:36,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:36,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:36,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:36,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_291|]. (let ((.cse0 (select |v_#memory_int_291| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_291| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:36,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:36,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:36,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:36,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:36,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_292|]. (let ((.cse0 (select |v_#memory_int_292| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_292| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:37,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_293|]. (let ((.cse0 (select |v_#memory_int_293| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:37,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_294|]. (let ((.cse0 (select |v_#memory_int_294| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_294| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:37,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_295|]. (let ((.cse0 (select |v_#memory_int_295| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_295| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:37,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:37,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_296|]. (let ((.cse0 (select |v_#memory_int_296| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_296| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:37,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_297|]. (let ((.cse0 (select |v_#memory_int_297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:37,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:37,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_298|]. (let ((.cse0 (select |v_#memory_int_298| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:28:37,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:37,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_299|]. (let ((.cse0 (select |v_#memory_int_299| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:37,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_300|]. (let ((.cse0 (select |v_#memory_int_300| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,459 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:37,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_301|]. (let ((.cse0 (select |v_#memory_int_301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:37,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:37,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_302|]. (let ((.cse0 (select |v_#memory_int_302| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:37,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:37,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_303|]. (let ((.cse0 (select |v_#memory_int_303| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_303| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:37,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:37,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_304|]. (let ((.cse0 (select |v_#memory_int_304| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_304| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:37,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_305|]. (let ((.cse0 (select |v_#memory_int_305| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_305| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:37,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:37,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:37,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:37,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:37,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:37,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_306|]. (let ((.cse0 (select |v_#memory_int_306| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_306| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:37,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:37,731 INFO L273 TraceCheckUtils]: 0: Hoare triple {2912#true} havoc main_p1; {2912#true} is VALID [2019-05-15 10:28:37,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {2912#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {2912#true} is VALID [2019-05-15 10:28:37,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {2912#true} #memory_int := #memory_int[main_p1 := 0]; {2923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:37,733 INFO L273 TraceCheckUtils]: 3: Hoare triple {2923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:37,734 INFO L273 TraceCheckUtils]: 4: Hoare triple {2927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:37,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {2931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:37,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {2935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:37,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {2939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:37,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {2943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:37,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {2947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:37,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {2951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:37,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {2955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:37,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {2959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:37,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {2963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:37,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {2967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:37,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {2971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:37,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {2975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:37,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {2979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:37,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {2983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:37,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {2987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:37,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {2991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:37,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {2995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:37,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {2999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:37,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:37,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {3007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:37,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {3011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:37,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {3015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} assume !(#memory_int[main_p1] >= 0); {2913#false} is VALID [2019-05-15 10:28:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:37,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-15 10:28:37,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-05-15 10:28:37,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:37,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2019-05-15 10:28:37,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:37,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-05-15 10:28:37,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-15 10:28:37,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:37,782 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 26 states. [2019-05-15 10:28:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,094 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-15 10:28:39,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-05-15 10:28:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-05-15 10:28:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-05-15 10:28:39,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2019-05-15 10:28:39,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:39,123 INFO L225 Difference]: With dead ends: 29 [2019-05-15 10:28:39,123 INFO L226 Difference]: Without dead ends: 29 [2019-05-15 10:28:39,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-05-15 10:28:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-05-15 10:28:39,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-05-15 10:28:39,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:39,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:39,125 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:39,125 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,126 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:39,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:39,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:39,127 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:39,127 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-05-15 10:28:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:39,128 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-05-15 10:28:39,128 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:39,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:39,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:39,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:39,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-05-15 10:28:39,129 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-05-15 10:28:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:39,129 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-05-15 10:28:39,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-05-15 10:28:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-05-15 10:28:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-05-15 10:28:39,130 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:39,130 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-05-15 10:28:39,130 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 863965832, now seen corresponding path program 24 times [2019-05-15 10:28:39,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:39,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-15 10:28:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:39,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:39,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:39,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:39,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_307|]. (= (store |v_#memory_int_307| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:39,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:39,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_308|]. (let ((.cse0 (select |v_#memory_int_308| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_308| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:39,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:39,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_309|]. (let ((.cse0 (select |v_#memory_int_309| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_309| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:39,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:39,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_310|]. (let ((.cse0 (select |v_#memory_int_310| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_310| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:39,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:39,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_311|]. (let ((.cse0 (select |v_#memory_int_311| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_311| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:39,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:39,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_312|]. (let ((.cse0 (select |v_#memory_int_312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:39,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:39,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_313|]. (let ((.cse0 (select |v_#memory_int_313| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:28:39,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:39,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_314|]. (let ((.cse0 (select |v_#memory_int_314| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:39,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:39,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_315|]. (let ((.cse0 (select |v_#memory_int_315| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_315| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:39,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:39,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_316|]. (let ((.cse0 (select |v_#memory_int_316| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:39,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:39,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_317|]. (let ((.cse0 (select |v_#memory_int_317| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:39,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:39,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_318|]. (let ((.cse0 (select |v_#memory_int_318| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_318| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:39,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:39,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_319|]. (let ((.cse0 (select |v_#memory_int_319| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:39,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:39,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_320|]. (let ((.cse0 (select |v_#memory_int_320| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_320| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:39,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:39,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_321|]. (let ((.cse0 (select |v_#memory_int_321| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_321| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:39,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:39,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,911 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_322|]. (let ((.cse0 (select |v_#memory_int_322| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_322| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:39,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:39,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:39,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:39,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:39,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:39,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:39,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_323|]. (let ((.cse0 (select |v_#memory_int_323| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:39,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:39,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_324|]. (let ((.cse0 (select |v_#memory_int_324| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_324| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:40,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:40,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_325|]. (let ((.cse0 (select |v_#memory_int_325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:28:40,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:40,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,151 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,151 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_326|]. (let ((.cse0 (select |v_#memory_int_326| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_326| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:28:40,151 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:40,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,185 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_327|]. (let ((.cse0 (select |v_#memory_int_327| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:28:40,185 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:40,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_328|]. (let ((.cse0 (select |v_#memory_int_328| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:40,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_329|]. (let ((.cse0 (select |v_#memory_int_329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:40,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:40,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_330|]. (let ((.cse0 (select |v_#memory_int_330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:28:40,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:40,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:40,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:40,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:40,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:40,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:40,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_331|]. (let ((.cse0 (select |v_#memory_int_331| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:40,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:40,363 INFO L273 TraceCheckUtils]: 0: Hoare triple {3134#true} havoc main_p1; {3134#true} is VALID [2019-05-15 10:28:40,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {3134#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3134#true} is VALID [2019-05-15 10:28:40,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {3134#true} #memory_int := #memory_int[main_p1 := 0]; {3145#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:40,364 INFO L273 TraceCheckUtils]: 3: Hoare triple {3145#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3149#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:40,365 INFO L273 TraceCheckUtils]: 4: Hoare triple {3149#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3153#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:40,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {3153#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3157#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:40,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {3157#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3161#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:40,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {3161#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3165#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:40,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {3165#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3169#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:40,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {3169#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3173#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:40,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {3173#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3177#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:40,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {3177#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3181#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:40,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {3181#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3185#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:40,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {3185#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3189#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:40,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3193#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:40,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {3193#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3197#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:40,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {3197#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3201#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:40,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {3201#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3205#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:40,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {3205#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3209#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:40,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {3209#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3213#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:40,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {3213#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3217#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:40,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {3217#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3221#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:40,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {3221#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3225#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:40,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {3225#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3229#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:40,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {3229#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3233#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:40,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {3233#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3237#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:40,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {3237#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3241#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:40,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {3241#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} assume !(#memory_int[main_p1] >= 0); {3135#false} is VALID [2019-05-15 10:28:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:40,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:40,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-15 10:28:40,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-05-15 10:28:40,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:40,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2019-05-15 10:28:40,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:40,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-05-15 10:28:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-15 10:28:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-05-15 10:28:40,416 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 27 states. [2019-05-15 10:28:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:41,816 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-15 10:28:41,816 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-05-15 10:28:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-05-15 10:28:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:28:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-05-15 10:28:41,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2019-05-15 10:28:41,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:41,853 INFO L225 Difference]: With dead ends: 30 [2019-05-15 10:28:41,853 INFO L226 Difference]: Without dead ends: 30 [2019-05-15 10:28:41,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-05-15 10:28:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-05-15 10:28:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-05-15 10:28:41,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:41,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:41,855 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:41,856 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:41,856 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:41,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:41,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:41,856 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:41,857 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2019-05-15 10:28:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:41,857 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-05-15 10:28:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:41,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:41,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:41,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:41,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-05-15 10:28:41,858 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-05-15 10:28:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:41,858 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-05-15 10:28:41,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-05-15 10:28:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-05-15 10:28:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-05-15 10:28:41,859 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:41,859 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-05-15 10:28:41,859 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:41,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1013136962, now seen corresponding path program 25 times [2019-05-15 10:28:41,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:41,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-15 10:28:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:41,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:41,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:41,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:41,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:41,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:41,911 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_332|]. (= (store |v_#memory_int_332| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:41,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:41,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:41,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:41,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:41,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:41,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_333|]. (let ((.cse0 (select |v_#memory_int_333| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_333| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:41,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:41,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:41,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:41,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:41,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:41,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_334|]. (let ((.cse0 (select |v_#memory_int_334| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_334| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:41,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:41,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:41,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:41,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:41,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:41,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_335|]. (let ((.cse0 (select |v_#memory_int_335| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_335| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:41,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:41,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:41,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:41,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:41,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_336|]. (let ((.cse0 (select |v_#memory_int_336| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_336| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:28:42,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:42,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_337|]. (let ((.cse0 (select |v_#memory_int_337| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:42,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:42,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_338|]. (let ((.cse0 (select |v_#memory_int_338| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_338| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:28:42,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:42,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_339|]. (let ((.cse0 (select |v_#memory_int_339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:42,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:42,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_340|]. (let ((.cse0 (select |v_#memory_int_340| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:42,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:42,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_341|]. (let ((.cse0 (select |v_#memory_int_341| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_341| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:42,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_342|]. (let ((.cse0 (select |v_#memory_int_342| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:42,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:42,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_343|]. (let ((.cse0 (select |v_#memory_int_343| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_343| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:42,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_344|]. (let ((.cse0 (select |v_#memory_int_344| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_344| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:42,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:42,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_345|]. (let ((.cse0 (select |v_#memory_int_345| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_345| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:42,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,460 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_346|]. (let ((.cse0 (select |v_#memory_int_346| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:42,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:42,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_347|]. (let ((.cse0 (select |v_#memory_int_347| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:28:42,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:42,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_348|]. (let ((.cse0 (select |v_#memory_int_348| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:42,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:42,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,596 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_349|]. (let ((.cse0 (select |v_#memory_int_349| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_349| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:42,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:42,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_350|]. (let ((.cse0 (select |v_#memory_int_350| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:28:42,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:42,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_351|]. (let ((.cse0 (select |v_#memory_int_351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:28:42,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:42,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_352|]. (let ((.cse0 (select |v_#memory_int_352| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_352| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:28:42,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:42,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_353|]. (let ((.cse0 (select |v_#memory_int_353| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:28:42,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:42,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_354|]. (let ((.cse0 (select |v_#memory_int_354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:42,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:42,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_355|]. (let ((.cse0 (select |v_#memory_int_355| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_355| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:28:42,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:42,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_356|]. (let ((.cse0 (select |v_#memory_int_356| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_356| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:28:42,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:42,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:42,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:42,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:42,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:42,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:42,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_357|]. (let ((.cse0 (select |v_#memory_int_357| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:28:42,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:42,928 INFO L273 TraceCheckUtils]: 0: Hoare triple {3364#true} havoc main_p1; {3364#true} is VALID [2019-05-15 10:28:42,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {3364#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3364#true} is VALID [2019-05-15 10:28:42,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {3364#true} #memory_int := #memory_int[main_p1 := 0]; {3375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:42,929 INFO L273 TraceCheckUtils]: 3: Hoare triple {3375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:42,930 INFO L273 TraceCheckUtils]: 4: Hoare triple {3379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:42,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {3383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:42,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {3387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:42,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {3391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:42,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {3395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:42,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {3399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:42,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {3403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:42,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {3407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:42,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {3411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:42,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {3415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:42,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {3419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:42,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {3423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:42,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {3427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:42,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {3431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:42,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {3435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:42,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {3439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:42,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {3443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:42,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:42,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {3451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:42,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {3455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:42,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {3459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:42,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {3463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:42,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {3467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:42,947 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:42,948 INFO L273 TraceCheckUtils]: 28: Hoare triple {3475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} assume !(#memory_int[main_p1] >= 0); {3365#false} is VALID [2019-05-15 10:28:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:42,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:42,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-15 10:28:42,950 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-05-15 10:28:42,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:42,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2019-05-15 10:28:42,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:42,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-05-15 10:28:42,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-15 10:28:42,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:42,978 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 28 states. [2019-05-15 10:28:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,468 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-15 10:28:44,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-05-15 10:28:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-05-15 10:28:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-05-15 10:28:44,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2019-05-15 10:28:44,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:44,497 INFO L225 Difference]: With dead ends: 31 [2019-05-15 10:28:44,498 INFO L226 Difference]: Without dead ends: 31 [2019-05-15 10:28:44,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-05-15 10:28:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-05-15 10:28:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-05-15 10:28:44,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:44,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:44,501 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:44,501 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,502 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:44,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:44,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:44,502 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:44,502 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-05-15 10:28:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:44,503 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-05-15 10:28:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:44,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:44,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:44,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:44,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:44,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-05-15 10:28:44,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-05-15 10:28:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:44,505 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-05-15 10:28:44,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-05-15 10:28:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-05-15 10:28:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-05-15 10:28:44,505 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:44,505 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-05-15 10:28:44,506 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:44,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1342474696, now seen corresponding path program 26 times [2019-05-15 10:28:44,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:44,519 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-15 10:28:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:44,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:44,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:44,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:44,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_358|]. (= (store |v_#memory_int_358| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:44,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:44,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:44,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_359|]. (let ((.cse0 (select |v_#memory_int_359| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_359| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:28:44,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:44,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:44,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_360|]. (let ((.cse0 (select |v_#memory_int_360| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_360| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:28:44,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:44,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:44,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_361|]. (let ((.cse0 (select |v_#memory_int_361| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:28:44,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:44,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:44,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_362|]. (let ((.cse0 (select |v_#memory_int_362| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_362| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:44,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:44,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:44,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:44,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:44,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:44,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_363|]. (let ((.cse0 (select |v_#memory_int_363| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_363| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:44,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:44,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:44,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_364|]. (let ((.cse0 (select |v_#memory_int_364| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_364| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:45,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_365|]. (let ((.cse0 (select |v_#memory_int_365| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_365| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:45,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:45,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_366|]. (let ((.cse0 (select |v_#memory_int_366| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_366| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:45,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_367|]. (let ((.cse0 (select |v_#memory_int_367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:45,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:45,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_368|]. (let ((.cse0 (select |v_#memory_int_368| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_368| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:45,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_369|]. (let ((.cse0 (select |v_#memory_int_369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:45,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:45,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_370|]. (let ((.cse0 (select |v_#memory_int_370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:45,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:45,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_371|]. (let ((.cse0 (select |v_#memory_int_371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:45,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:45,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,234 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_372|]. (let ((.cse0 (select |v_#memory_int_372| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:45,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:45,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_373|]. (let ((.cse0 (select |v_#memory_int_373| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_373| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:28:45,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:45,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_374|]. (let ((.cse0 (select |v_#memory_int_374| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_374| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:28:45,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:45,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_375|]. (let ((.cse0 (select |v_#memory_int_375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:45,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:45,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_376|]. (let ((.cse0 (select |v_#memory_int_376| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_376| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:45,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:45,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_377|]. (let ((.cse0 (select |v_#memory_int_377| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:28:45,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:45,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_378|]. (let ((.cse0 (select |v_#memory_int_378| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_378| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:45,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:45,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:45,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:45,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:45,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:45,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:45,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_379|]. (let ((.cse0 (select |v_#memory_int_379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:45,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:46,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:46,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:46,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_380|]. (let ((.cse0 (select |v_#memory_int_380| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:46,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:46,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:46,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:46,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_381|]. (let ((.cse0 (select |v_#memory_int_381| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_381| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:28:46,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:46,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:46,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:46,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_382|]. (let ((.cse0 (select |v_#memory_int_382| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_382| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:46,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:46,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:46,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:46,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_383|]. (let ((.cse0 (select |v_#memory_int_383| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_383| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:28:46,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:46,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:46,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:46,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:46,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:46,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:46,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_384|]. (let ((.cse0 (select |v_#memory_int_384| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_384| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 25))) [2019-05-15 10:28:46,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:46,233 INFO L273 TraceCheckUtils]: 0: Hoare triple {3602#true} havoc main_p1; {3602#true} is VALID [2019-05-15 10:28:46,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {3602#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3602#true} is VALID [2019-05-15 10:28:46,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {3602#true} #memory_int := #memory_int[main_p1 := 0]; {3613#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:46,235 INFO L273 TraceCheckUtils]: 3: Hoare triple {3613#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3617#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:46,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {3617#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3621#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:46,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {3621#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3625#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:46,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {3625#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3629#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:46,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {3629#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3633#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:46,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {3633#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3637#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:46,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {3637#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3641#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:46,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {3641#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3645#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:46,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {3645#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3649#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:46,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {3649#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3653#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:46,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {3653#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3657#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:46,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {3657#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3661#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:46,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {3661#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3665#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:46,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {3665#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3669#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:46,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3673#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:46,247 INFO L273 TraceCheckUtils]: 18: Hoare triple {3673#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3677#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:46,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {3677#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3681#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:46,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {3681#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3685#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:46,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {3685#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3689#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:46,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {3689#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3693#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:46,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {3693#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3697#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:46,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {3697#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3701#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:46,253 INFO L273 TraceCheckUtils]: 25: Hoare triple {3701#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3705#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:46,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {3705#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3709#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:46,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {3709#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3713#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:46,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {3713#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3717#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:46,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {3717#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} assume !(#memory_int[main_p1] >= 0); {3603#false} is VALID [2019-05-15 10:28:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:46,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:46,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-15 10:28:46,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-05-15 10:28:46,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:46,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2019-05-15 10:28:46,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:46,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-05-15 10:28:46,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-15 10:28:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-05-15 10:28:46,284 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 29 states. [2019-05-15 10:28:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:47,968 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-15 10:28:47,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 30 [2019-05-15 10:28:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-05-15 10:28:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-05-15 10:28:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-05-15 10:28:47,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 33 transitions. [2019-05-15 10:28:48,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:48,036 INFO L225 Difference]: With dead ends: 32 [2019-05-15 10:28:48,036 INFO L226 Difference]: Without dead ends: 32 [2019-05-15 10:28:48,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-05-15 10:28:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-05-15 10:28:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-05-15 10:28:48,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:48,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:48,040 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:48,040 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:48,041 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:48,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:48,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:48,041 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:48,041 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-05-15 10:28:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:48,042 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:28:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:48,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:48,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:48,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:48,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:48,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-05-15 10:28:48,044 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-05-15 10:28:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:48,044 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-05-15 10:28:48,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-05-15 10:28:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:28:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-05-15 10:28:48,044 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:48,045 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-05-15 10:28:48,045 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:48,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1332957438, now seen corresponding path program 27 times [2019-05-15 10:28:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:48,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-15 10:28:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:48,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:48,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:48,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:48,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_385|]. (= |#memory_int| (store |v_#memory_int_385| ULTIMATE.start_main_p1 0)) [2019-05-15 10:28:48,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:48,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,187 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_386|]. (let ((.cse0 (select |v_#memory_int_386| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:48,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:48,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_387|]. (let ((.cse0 (select |v_#memory_int_387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:28:48,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:48,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_388|]. (let ((.cse0 (select |v_#memory_int_388| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:48,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_389|]. (let ((.cse0 (select |v_#memory_int_389| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_389| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:28:48,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:48,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_390|]. (let ((.cse0 (select |v_#memory_int_390| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_390| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:48,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_391|]. (let ((.cse0 (select |v_#memory_int_391| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_391| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:48,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_392|]. (let ((.cse0 (select |v_#memory_int_392| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:28:48,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:48,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_393|]. (let ((.cse0 (select |v_#memory_int_393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:28:48,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:48,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_394|]. (let ((.cse0 (select |v_#memory_int_394| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:28:48,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:48,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,486 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_395|]. (let ((.cse0 (select |v_#memory_int_395| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:48,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_396|]. (let ((.cse0 (select |v_#memory_int_396| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_396| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:28:48,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:48,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_397|]. (let ((.cse0 (select |v_#memory_int_397| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_397| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:28:48,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:48,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_398|]. (let ((.cse0 (select |v_#memory_int_398| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:28:48,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:48,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_399|]. (let ((.cse0 (select |v_#memory_int_399| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:48,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:48,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_400|]. (let ((.cse0 (select |v_#memory_int_400| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:48,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_401|]. (let ((.cse0 (select |v_#memory_int_401| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_401| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:48,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_402|]. (let ((.cse0 (select |v_#memory_int_402| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_402| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:48,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:48,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_403|]. (let ((.cse0 (select |v_#memory_int_403| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_403| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:28:48,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:48,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,771 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_404|]. (let ((.cse0 (select |v_#memory_int_404| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:28:48,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:48,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_405|]. (let ((.cse0 (select |v_#memory_int_405| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:28:48,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:48,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,838 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_406|]. (let ((.cse0 (select |v_#memory_int_406| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_406| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:48,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:48,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_407|]. (let ((.cse0 (select |v_#memory_int_407| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_407| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:48,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_408|]. (let ((.cse0 (select |v_#memory_int_408| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_408| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:48,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:48,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:48,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:48,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_409|]. (let ((.cse0 (select |v_#memory_int_409| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_409| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:28:48,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:48,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:48,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:48,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:48,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_410|]. (let ((.cse0 (select |v_#memory_int_410| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_410| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:28:49,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:49,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_411|]. (let ((.cse0 (select |v_#memory_int_411| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_411| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:49,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:49,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:49,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:49,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:49,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:49,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:49,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_412|]. (let ((.cse0 (select |v_#memory_int_412| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:28:49,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:49,120 INFO L273 TraceCheckUtils]: 0: Hoare triple {3848#true} havoc main_p1; {3848#true} is VALID [2019-05-15 10:28:49,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {3848#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {3848#true} is VALID [2019-05-15 10:28:49,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {3848#true} #memory_int := #memory_int[main_p1 := 0]; {3859#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:49,122 INFO L273 TraceCheckUtils]: 3: Hoare triple {3859#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3863#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:49,122 INFO L273 TraceCheckUtils]: 4: Hoare triple {3863#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3867#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:49,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {3867#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3871#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:49,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {3871#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3875#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:49,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {3875#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3879#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:49,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {3879#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3883#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:49,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {3883#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3887#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:49,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {3887#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3891#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:49,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {3891#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3895#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:49,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {3895#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3899#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:49,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {3899#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3903#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:49,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {3903#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3907#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:49,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {3907#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3911#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:49,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {3911#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3915#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:49,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {3915#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3919#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:49,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {3919#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3923#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:49,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {3923#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3927#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:49,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {3927#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3931#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:49,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {3931#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3935#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:49,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {3935#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3939#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:49,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {3939#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3943#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:49,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {3943#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3947#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:49,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {3947#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3951#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:49,145 INFO L273 TraceCheckUtils]: 26: Hoare triple {3951#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3955#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:49,145 INFO L273 TraceCheckUtils]: 27: Hoare triple {3955#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3959#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:49,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {3959#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3963#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:49,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {3963#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {3967#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:49,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {3967#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} assume !(#memory_int[main_p1] >= 0); {3849#false} is VALID [2019-05-15 10:28:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:49,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:49,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-15 10:28:49,149 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-05-15 10:28:49,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:49,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2019-05-15 10:28:49,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:49,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-05-15 10:28:49,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-15 10:28:49,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:49,176 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 30 states. [2019-05-15 10:28:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:50,888 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:50,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-15 10:28:50,889 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 31 [2019-05-15 10:28:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-05-15 10:28:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-05-15 10:28:50,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2019-05-15 10:28:50,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:50,919 INFO L225 Difference]: With dead ends: 33 [2019-05-15 10:28:50,919 INFO L226 Difference]: Without dead ends: 33 [2019-05-15 10:28:50,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-05-15 10:28:50,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-05-15 10:28:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-05-15 10:28:50,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:50,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:50,922 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:50,922 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:50,923 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:50,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:50,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:50,923 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:50,923 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-05-15 10:28:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:50,924 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-05-15 10:28:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:50,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:50,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:50,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:50,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:50,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:28:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-05-15 10:28:50,925 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-05-15 10:28:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:50,925 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-05-15 10:28:50,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-05-15 10:28:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-05-15 10:28:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-05-15 10:28:50,925 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:50,925 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-05-15 10:28:50,926 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1627992328, now seen corresponding path program 28 times [2019-05-15 10:28:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:50,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-15 10:28:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:50,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:50,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:50,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:50,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:50,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:50,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:50,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_413|]. (= (store |v_#memory_int_413| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:50,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:51,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_414|]. (let ((.cse0 (select |v_#memory_int_414| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_414| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:28:51,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:51,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_415|]. (let ((.cse0 (select |v_#memory_int_415| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_415| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:28:51,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:51,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_416|]. (let ((.cse0 (select |v_#memory_int_416| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_416| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:28:51,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:51,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_417|]. (let ((.cse0 (select |v_#memory_int_417| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_417| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:51,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_418|]. (let ((.cse0 (select |v_#memory_int_418| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_418| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:51,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:51,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_419|]. (let ((.cse0 (select |v_#memory_int_419| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_419| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:28:51,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:51,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_420|]. (let ((.cse0 (select |v_#memory_int_420| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_420| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:51,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:51,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_421|]. (let ((.cse0 (select |v_#memory_int_421| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_421| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:51,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_422|]. (let ((.cse0 (select |v_#memory_int_422| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_422| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:28:51,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:51,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_423|]. (let ((.cse0 (select |v_#memory_int_423| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_423| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:28:51,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:51,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_424|]. (let ((.cse0 (select |v_#memory_int_424| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:28:51,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:51,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_425|]. (let ((.cse0 (select |v_#memory_int_425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:28:51,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:51,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_426|]. (let ((.cse0 (select |v_#memory_int_426| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:51,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_427|]. (let ((.cse0 (select |v_#memory_int_427| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_427| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:51,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_428|]. (let ((.cse0 (select |v_#memory_int_428| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:51,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_429|]. (let ((.cse0 (select |v_#memory_int_429| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_429| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:51,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_430|]. (let ((.cse0 (select |v_#memory_int_430| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_430| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:51,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_431|]. (let ((.cse0 (select |v_#memory_int_431| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_431| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:51,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_432|]. (let ((.cse0 (select |v_#memory_int_432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:28:51,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:51,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_433|]. (let ((.cse0 (select |v_#memory_int_433| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:51,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:51,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_434|]. (let ((.cse0 (select |v_#memory_int_434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:51,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:51,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_435|]. (let ((.cse0 (select |v_#memory_int_435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:28:51,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:51,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_436|]. (let ((.cse0 (select |v_#memory_int_436| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_436| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:28:51,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:51,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_437|]. (let ((.cse0 (select |v_#memory_int_437| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_437| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:51,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_438|]. (let ((.cse0 (select |v_#memory_int_438| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_438| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:51,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:51,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:51,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:51,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:51,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:51,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:51,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_439|]. (let ((.cse0 (select |v_#memory_int_439| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_439| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:28:51,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:52,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,187 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_440|]. (let ((.cse0 (select |v_#memory_int_440| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_440| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:28:52,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:52,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:52,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:52,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:52,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:52,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:52,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_441|]. (let ((.cse0 (select |v_#memory_int_441| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:52,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:28:52,307 INFO L273 TraceCheckUtils]: 0: Hoare triple {4102#true} havoc main_p1; {4102#true} is VALID [2019-05-15 10:28:52,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {4102#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4102#true} is VALID [2019-05-15 10:28:52,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {4102#true} #memory_int := #memory_int[main_p1 := 0]; {4113#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:52,308 INFO L273 TraceCheckUtils]: 3: Hoare triple {4113#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4117#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:52,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {4117#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4121#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:52,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {4121#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4125#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:52,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {4125#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4129#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:52,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {4129#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4133#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:52,312 INFO L273 TraceCheckUtils]: 8: Hoare triple {4133#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4137#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:52,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {4137#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4141#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:52,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {4141#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4145#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:52,315 INFO L273 TraceCheckUtils]: 11: Hoare triple {4145#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4149#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:52,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {4149#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4153#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:52,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {4153#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4157#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:52,317 INFO L273 TraceCheckUtils]: 14: Hoare triple {4157#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4161#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:52,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {4161#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4165#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:52,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {4165#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4169#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:52,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {4169#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4173#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:52,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {4173#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4177#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:52,321 INFO L273 TraceCheckUtils]: 19: Hoare triple {4177#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4181#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:52,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {4181#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4185#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:52,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {4185#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4189#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:52,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {4189#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4193#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:52,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {4193#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4197#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:52,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {4197#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4201#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:52,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {4201#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4205#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:52,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {4205#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4209#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:52,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {4209#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4213#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:52,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {4213#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4217#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:52,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {4217#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4221#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:52,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {4221#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4225#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:28:52,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {4225#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} assume !(#memory_int[main_p1] >= 0); {4103#false} is VALID [2019-05-15 10:28:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:52,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:52,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-15 10:28:52,350 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-05-15 10:28:52,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:52,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2019-05-15 10:28:52,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:52,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-05-15 10:28:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-15 10:28:52,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-05-15 10:28:52,380 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 31 states. [2019-05-15 10:28:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,345 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-15 10:28:54,345 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 32 [2019-05-15 10:28:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-05-15 10:28:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-05-15 10:28:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-05-15 10:28:54,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2019-05-15 10:28:54,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:54,414 INFO L225 Difference]: With dead ends: 34 [2019-05-15 10:28:54,415 INFO L226 Difference]: Without dead ends: 34 [2019-05-15 10:28:54,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-05-15 10:28:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-05-15 10:28:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-05-15 10:28:54,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:54,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:54,418 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:54,418 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,419 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:54,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:54,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:54,419 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:54,419 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2019-05-15 10:28:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:54,420 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-05-15 10:28:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:54,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:54,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:54,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:54,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:28:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-05-15 10:28:54,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-05-15 10:28:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:54,421 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-05-15 10:28:54,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-05-15 10:28:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-05-15 10:28:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-05-15 10:28:54,422 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:54,422 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-05-15 10:28:54,422 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:54,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1071845438, now seen corresponding path program 29 times [2019-05-15 10:28:54,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:54,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-15 10:28:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:54,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:54,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:54,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:54,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_442|]. (= (store |v_#memory_int_442| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:54,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:54,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_443|]. (let ((.cse0 (select |v_#memory_int_443| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:28:54,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:54,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_444|]. (let ((.cse0 (select |v_#memory_int_444| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_444| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:28:54,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:54,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_445|]. (let ((.cse0 (select |v_#memory_int_445| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_445| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:28:54,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:54,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_446|]. (let ((.cse0 (select |v_#memory_int_446| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:54,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:54,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_447|]. (let ((.cse0 (select |v_#memory_int_447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:28:54,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:54,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_448|]. (let ((.cse0 (select |v_#memory_int_448| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_448| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:54,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:54,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:54,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:54,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:54,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:54,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:54,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_449|]. (let ((.cse0 (select |v_#memory_int_449| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_449| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:28:54,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:55,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_450|]. (let ((.cse0 (select |v_#memory_int_450| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_450| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:28:55,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:55,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_451|]. (let ((.cse0 (select |v_#memory_int_451| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:55,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_452|]. (let ((.cse0 (select |v_#memory_int_452| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_452| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:28:55,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:55,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_453|]. (let ((.cse0 (select |v_#memory_int_453| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:55,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_454|]. (let ((.cse0 (select |v_#memory_int_454| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:55,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_455|]. (let ((.cse0 (select |v_#memory_int_455| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:28:55,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:55,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_456|]. (let ((.cse0 (select |v_#memory_int_456| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_456| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:55,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_457|]. (let ((.cse0 (select |v_#memory_int_457| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_457| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:28:55,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:55,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_458|]. (let ((.cse0 (select |v_#memory_int_458| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_458| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:28:55,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:55,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_459|]. (let ((.cse0 (select |v_#memory_int_459| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:28:55,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:55,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_460|]. (let ((.cse0 (select |v_#memory_int_460| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:55,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:55,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_461|]. (let ((.cse0 (select |v_#memory_int_461| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:28:55,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:55,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_462|]. (let ((.cse0 (select |v_#memory_int_462| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_462| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:55,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_463|]. (let ((.cse0 (select |v_#memory_int_463| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:28:55,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:55,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_464|]. (let ((.cse0 (select |v_#memory_int_464| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:55,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:55,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_465|]. (let ((.cse0 (select |v_#memory_int_465| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_465| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:28:55,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:55,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_466|]. (let ((.cse0 (select |v_#memory_int_466| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_466| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:55,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_467|]. (let ((.cse0 (select |v_#memory_int_467| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_467| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:28:55,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:55,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_468|]. (let ((.cse0 (select |v_#memory_int_468| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_468| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:55,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:55,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:55,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:55,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:55,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:55,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:55,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_469|]. (let ((.cse0 (select |v_#memory_int_469| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:28:55,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:56,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:56,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:56,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:56,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:56,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:56,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:56,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_470|]. (let ((.cse0 (select |v_#memory_int_470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:28:56,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:28:56,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:56,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:56,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:56,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:56,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:56,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:56,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_471|]. (let ((.cse0 (select |v_#memory_int_471| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_471| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:28:56,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:28:56,105 INFO L273 TraceCheckUtils]: 0: Hoare triple {4364#true} havoc main_p1; {4364#true} is VALID [2019-05-15 10:28:56,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {4364#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4364#true} is VALID [2019-05-15 10:28:56,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {4364#true} #memory_int := #memory_int[main_p1 := 0]; {4375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:56,107 INFO L273 TraceCheckUtils]: 3: Hoare triple {4375#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:56,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {4379#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:56,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {4383#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:56,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {4387#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:56,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {4391#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:56,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {4395#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:56,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {4399#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:56,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {4403#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:56,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {4407#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:56,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {4411#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:56,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {4415#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:56,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {4419#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:56,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {4423#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:56,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {4427#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:56,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {4431#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:56,116 INFO L273 TraceCheckUtils]: 18: Hoare triple {4435#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:56,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {4439#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:56,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {4443#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:56,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {4447#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:56,119 INFO L273 TraceCheckUtils]: 22: Hoare triple {4451#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:56,120 INFO L273 TraceCheckUtils]: 23: Hoare triple {4455#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:56,120 INFO L273 TraceCheckUtils]: 24: Hoare triple {4459#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:56,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {4463#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:56,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {4467#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:56,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {4471#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:56,124 INFO L273 TraceCheckUtils]: 28: Hoare triple {4475#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4479#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:56,125 INFO L273 TraceCheckUtils]: 29: Hoare triple {4479#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4483#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:56,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {4483#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4487#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:28:56,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {4487#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4491#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:28:56,126 INFO L273 TraceCheckUtils]: 32: Hoare triple {4491#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} assume !(#memory_int[main_p1] >= 0); {4365#false} is VALID [2019-05-15 10:28:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:56,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:56,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-15 10:28:56,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-05-15 10:28:56,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:56,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2019-05-15 10:28:56,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:56,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-05-15 10:28:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-15 10:28:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:28:56,156 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2019-05-15 10:28:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,118 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-15 10:28:58,119 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 33 [2019-05-15 10:28:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:28:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:28:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-05-15 10:28:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-05-15 10:28:58,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2019-05-15 10:28:58,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:58,149 INFO L225 Difference]: With dead ends: 35 [2019-05-15 10:28:58,149 INFO L226 Difference]: Without dead ends: 35 [2019-05-15 10:28:58,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-05-15 10:28:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-05-15 10:28:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-05-15 10:28:58,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:28:58,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:58,152 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:58,152 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:58,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,153 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:58,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,154 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:58,154 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-05-15 10:28:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:28:58,154 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-05-15 10:28:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:58,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:28:58,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:28:58,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:28:58,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:28:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:28:58,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-05-15 10:28:58,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-05-15 10:28:58,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:28:58,155 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-05-15 10:28:58,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-05-15 10:28:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-05-15 10:28:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-05-15 10:28:58,156 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:28:58,156 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-05-15 10:28:58,156 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:28:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:28:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1132529736, now seen corresponding path program 30 times [2019-05-15 10:28:58,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:28:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-15 10:28:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:28:58,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:28:58,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:28:58,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:28:58,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_472|]. (= (store |v_#memory_int_472| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:28:58,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:28:58,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_473|]. (let ((.cse0 (select |v_#memory_int_473| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_473| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:58,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:28:58,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_474|]. (let ((.cse0 (select |v_#memory_int_474| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:28:58,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_475|]. (let ((.cse0 (select |v_#memory_int_475| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_475| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:28:58,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:28:58,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_476|]. (let ((.cse0 (select |v_#memory_int_476| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:28:58,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_477|]. (let ((.cse0 (select |v_#memory_int_477| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_477| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:28:58,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:28:58,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_478|]. (let ((.cse0 (select |v_#memory_int_478| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:28:58,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:28:58,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_479|]. (let ((.cse0 (select |v_#memory_int_479| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:28:58,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_480|]. (let ((.cse0 (select |v_#memory_int_480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:28:58,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:28:58,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_481|]. (let ((.cse0 (select |v_#memory_int_481| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:28:58,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:28:58,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_482|]. (let ((.cse0 (select |v_#memory_int_482| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_482| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:28:58,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:28:58,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_483|]. (let ((.cse0 (select |v_#memory_int_483| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_483| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:28:58,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:28:58,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_484|]. (let ((.cse0 (select |v_#memory_int_484| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_484| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:58,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:28:58,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_485|]. (let ((.cse0 (select |v_#memory_int_485| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:28:58,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:28:58,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_486|]. (let ((.cse0 (select |v_#memory_int_486| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:28:58,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:28:58,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_487|]. (let ((.cse0 (select |v_#memory_int_487| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_487| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:58,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:28:58,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_488|]. (let ((.cse0 (select |v_#memory_int_488| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:28:58,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:28:58,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_489|]. (let ((.cse0 (select |v_#memory_int_489| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_489| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:28:58,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:28:58,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,739 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_490|]. (let ((.cse0 (select |v_#memory_int_490| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:28:58,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:28:58,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_491|]. (let ((.cse0 (select |v_#memory_int_491| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_491| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:28:58,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:28:58,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,807 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_492|]. (let ((.cse0 (select |v_#memory_int_492| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_492| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:28:58,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:28:58,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_493|]. (let ((.cse0 (select |v_#memory_int_493| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_493| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:28:58,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_494|]. (let ((.cse0 (select |v_#memory_int_494| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_494| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:28:58,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:28:58,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_495|]. (let ((.cse0 (select |v_#memory_int_495| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:28:58,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_496|]. (let ((.cse0 (select |v_#memory_int_496| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_496| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:58,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:28:58,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:58,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:58,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:58,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:58,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:58,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_497|]. (let ((.cse0 (select |v_#memory_int_497| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_497| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:28:58,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:28:59,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_498|]. (let ((.cse0 (select |v_#memory_int_498| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_498| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:28:59,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:28:59,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_499|]. (let ((.cse0 (select |v_#memory_int_499| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_499| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:28:59,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:28:59,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_500|]. (let ((.cse0 (select |v_#memory_int_500| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:28:59,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_501|]. (let ((.cse0 (select |v_#memory_int_501| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:28:59,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:28:59,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:28:59,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:28:59,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:28:59,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:28:59,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_502|]. (let ((.cse0 (select |v_#memory_int_502| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_502| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:28:59,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:28:59,247 INFO L273 TraceCheckUtils]: 0: Hoare triple {4634#true} havoc main_p1; {4634#true} is VALID [2019-05-15 10:28:59,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {4634#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4634#true} is VALID [2019-05-15 10:28:59,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {4634#true} #memory_int := #memory_int[main_p1 := 0]; {4645#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:28:59,248 INFO L273 TraceCheckUtils]: 3: Hoare triple {4645#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4649#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:28:59,249 INFO L273 TraceCheckUtils]: 4: Hoare triple {4649#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4653#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:28:59,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {4653#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4657#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:28:59,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {4657#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4661#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:28:59,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {4661#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4665#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:28:59,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {4665#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4669#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:28:59,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {4669#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4673#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:28:59,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {4673#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4677#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:28:59,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {4677#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4681#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:28:59,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {4681#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4685#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:28:59,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {4685#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4689#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:28:59,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {4689#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4693#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:28:59,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {4693#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4697#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:28:59,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {4697#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4701#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:28:59,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {4701#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4705#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:28:59,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {4705#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4709#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:28:59,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {4709#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4713#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:28:59,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {4713#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4717#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:28:59,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {4717#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4721#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:28:59,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {4721#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4725#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:28:59,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {4725#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4729#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:28:59,302 INFO L273 TraceCheckUtils]: 24: Hoare triple {4729#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4733#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:28:59,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {4733#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4737#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:28:59,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {4737#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4741#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:28:59,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {4741#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4745#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:28:59,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {4745#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4749#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:28:59,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {4749#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4753#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:28:59,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {4753#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4757#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:28:59,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {4757#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4761#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:28:59,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {4761#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4765#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:28:59,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {4765#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} assume !(#memory_int[main_p1] >= 0); {4635#false} is VALID [2019-05-15 10:28:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:28:59,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:28:59,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-15 10:28:59,313 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-05-15 10:28:59,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:28:59,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2019-05-15 10:28:59,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:28:59,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-05-15 10:28:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-15 10:28:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-05-15 10:28:59,342 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2019-05-15 10:29:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:01,461 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:01,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-15 10:29:01,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 34 [2019-05-15 10:29:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:29:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-05-15 10:29:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-05-15 10:29:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-05-15 10:29:01,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2019-05-15 10:29:01,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:01,493 INFO L225 Difference]: With dead ends: 36 [2019-05-15 10:29:01,493 INFO L226 Difference]: Without dead ends: 36 [2019-05-15 10:29:01,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-05-15 10:29:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-05-15 10:29:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-05-15 10:29:01,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:01,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:01,496 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:01,496 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:01,497 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:01,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:01,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:01,498 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:01,498 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-05-15 10:29:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:01,498 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-05-15 10:29:01,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:01,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:01,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:01,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:01,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-05-15 10:29:01,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-05-15 10:29:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:01,500 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-05-15 10:29:01,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-05-15 10:29:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-05-15 10:29:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-05-15 10:29:01,501 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:01,501 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-05-15 10:29:01,501 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:01,501 INFO L82 PathProgramCache]: Analyzing trace with hash 748683394, now seen corresponding path program 31 times [2019-05-15 10:29:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:01,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-15 10:29:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:01,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:01,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:01,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:01,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_503|]. (= (store |v_#memory_int_503| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:01,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:01,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_504|]. (let ((.cse0 (select |v_#memory_int_504| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_504| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:01,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:01,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_505|]. (let ((.cse0 (select |v_#memory_int_505| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_505| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:01,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:01,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_506|]. (let ((.cse0 (select |v_#memory_int_506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:29:01,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:01,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_507|]. (let ((.cse0 (select |v_#memory_int_507| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_507| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:01,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:01,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_508|]. (let ((.cse0 (select |v_#memory_int_508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:29:01,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:01,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_509|]. (let ((.cse0 (select |v_#memory_int_509| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_509| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:01,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:01,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_510|]. (let ((.cse0 (select |v_#memory_int_510| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_510| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:29:01,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:01,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_511|]. (let ((.cse0 (select |v_#memory_int_511| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_511| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:29:01,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:01,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_512|]. (let ((.cse0 (select |v_#memory_int_512| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_512| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:29:01,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:01,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_513|]. (let ((.cse0 (select |v_#memory_int_513| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:01,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:01,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_514|]. (let ((.cse0 (select |v_#memory_int_514| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_514| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:29:01,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:01,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:01,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:01,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:01,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:01,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:01,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_515|]. (let ((.cse0 (select |v_#memory_int_515| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:01,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:02,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_516|]. (let ((.cse0 (select |v_#memory_int_516| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_516| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:02,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:02,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_517|]. (let ((.cse0 (select |v_#memory_int_517| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:29:02,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:02,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_518|]. (let ((.cse0 (select |v_#memory_int_518| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:02,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_519|]. (let ((.cse0 (select |v_#memory_int_519| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:29:02,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:02,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_520|]. (let ((.cse0 (select |v_#memory_int_520| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_520| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:02,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:02,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_521|]. (let ((.cse0 (select |v_#memory_int_521| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_521| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:02,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:02,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_522|]. (let ((.cse0 (select |v_#memory_int_522| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:29:02,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:02,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_523|]. (let ((.cse0 (select |v_#memory_int_523| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:29:02,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:02,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_524|]. (let ((.cse0 (select |v_#memory_int_524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:02,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:02,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_525|]. (let ((.cse0 (select |v_#memory_int_525| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:29:02,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:02,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_526|]. (let ((.cse0 (select |v_#memory_int_526| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_526| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:02,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:02,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_527|]. (let ((.cse0 (select |v_#memory_int_527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:29:02,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:02,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_528|]. (let ((.cse0 (select |v_#memory_int_528| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_528| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:02,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:02,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_529|]. (let ((.cse0 (select |v_#memory_int_529| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:02,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_530|]. (let ((.cse0 (select |v_#memory_int_530| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_530| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:02,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_531|]. (let ((.cse0 (select |v_#memory_int_531| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_531| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:02,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:02,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_532|]. (let ((.cse0 (select |v_#memory_int_532| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:02,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:02,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_533|]. (let ((.cse0 (select |v_#memory_int_533| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_533| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:02,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:02,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:02,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:02,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:02,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:02,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:02,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_534|]. (let ((.cse0 (select |v_#memory_int_534| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:02,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:03,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {4912#true} havoc main_p1; {4912#true} is VALID [2019-05-15 10:29:03,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {4912#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {4912#true} is VALID [2019-05-15 10:29:03,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {4912#true} #memory_int := #memory_int[main_p1 := 0]; {4923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:03,004 INFO L273 TraceCheckUtils]: 3: Hoare triple {4923#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:03,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {4927#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:03,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {4931#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:03,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {4935#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:03,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {4939#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:03,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {4943#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:03,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {4947#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:03,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {4951#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:03,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {4955#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:03,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {4959#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:03,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {4963#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:03,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {4967#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:03,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:03,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {4975#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:03,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {4979#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:03,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {4983#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:03,021 INFO L273 TraceCheckUtils]: 19: Hoare triple {4987#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:03,021 INFO L273 TraceCheckUtils]: 20: Hoare triple {4991#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:03,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {4995#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {4999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:03,023 INFO L273 TraceCheckUtils]: 22: Hoare triple {4999#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:03,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {5003#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:03,025 INFO L273 TraceCheckUtils]: 24: Hoare triple {5007#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:03,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {5011#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:03,027 INFO L273 TraceCheckUtils]: 26: Hoare triple {5015#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5019#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:03,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {5019#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5023#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:03,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {5023#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5027#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:03,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {5027#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5031#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:03,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {5031#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5035#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:03,032 INFO L273 TraceCheckUtils]: 31: Hoare triple {5035#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5039#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:03,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {5039#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5043#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:03,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {5043#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5047#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:03,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {5047#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} assume !(#memory_int[main_p1] >= 0); {4913#false} is VALID [2019-05-15 10:29:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:03,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:03,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-15 10:29:03,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-05-15 10:29:03,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:03,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2019-05-15 10:29:03,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:03,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-05-15 10:29:03,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-15 10:29:03,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:29:03,066 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2019-05-15 10:29:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,270 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:05,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-15 10:29:05,270 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2019-05-15 10:29:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:29:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:29:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-05-15 10:29:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-05-15 10:29:05,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2019-05-15 10:29:05,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:05,304 INFO L225 Difference]: With dead ends: 37 [2019-05-15 10:29:05,305 INFO L226 Difference]: Without dead ends: 37 [2019-05-15 10:29:05,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-05-15 10:29:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-05-15 10:29:05,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-05-15 10:29:05,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:05,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:05,307 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:05,307 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,308 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:05,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:05,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:05,308 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:05,308 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-05-15 10:29:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:05,309 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-05-15 10:29:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:05,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:05,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:05,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:05,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-05-15 10:29:05,310 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-05-15 10:29:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:05,310 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-05-15 10:29:05,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-05-15 10:29:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-05-15 10:29:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-05-15 10:29:05,311 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:05,311 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-05-15 10:29:05,311 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:05,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1734348680, now seen corresponding path program 32 times [2019-05-15 10:29:05,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:05,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-15 10:29:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:05,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:05,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:05,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:05,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_535|]. (= (store |v_#memory_int_535| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:05,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:05,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_536|]. (let ((.cse0 (select |v_#memory_int_536| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_536| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:05,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:05,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_537|]. (let ((.cse0 (select |v_#memory_int_537| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_537| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:29:05,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:05,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,447 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_538|]. (let ((.cse0 (select |v_#memory_int_538| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:05,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:05,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,467 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_539|]. (let ((.cse0 (select |v_#memory_int_539| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:29:05,468 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:05,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_540|]. (let ((.cse0 (select |v_#memory_int_540| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_540| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:05,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:05,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_541|]. (let ((.cse0 (select |v_#memory_int_541| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:05,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:05,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_542|]. (let ((.cse0 (select |v_#memory_int_542| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:05,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:05,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_543|]. (let ((.cse0 (select |v_#memory_int_543| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:05,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:05,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_544|]. (let ((.cse0 (select |v_#memory_int_544| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_544| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:05,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:05,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_545|]. (let ((.cse0 (select |v_#memory_int_545| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_545| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:05,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:05,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_546|]. (let ((.cse0 (select |v_#memory_int_546| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:29:05,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:05,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_547|]. (let ((.cse0 (select |v_#memory_int_547| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_547| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:29:05,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:05,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_548|]. (let ((.cse0 (select |v_#memory_int_548| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_548| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:05,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:05,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_549|]. (let ((.cse0 (select |v_#memory_int_549| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_549| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:29:05,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:05,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_550|]. (let ((.cse0 (select |v_#memory_int_550| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_550| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:05,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:05,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:05,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:05,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_551|]. (let ((.cse0 (select |v_#memory_int_551| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_551| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:29:05,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:05,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:05,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:05,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:05,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_552|]. (let ((.cse0 (select |v_#memory_int_552| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:06,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_553|]. (let ((.cse0 (select |v_#memory_int_553| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_553| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:06,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:06,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_554|]. (let ((.cse0 (select |v_#memory_int_554| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:06,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:06,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_555|]. (let ((.cse0 (select |v_#memory_int_555| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:06,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:06,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,829 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_556|]. (let ((.cse0 (select |v_#memory_int_556| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_556| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:29:06,829 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:06,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_557|]. (let ((.cse0 (select |v_#memory_int_557| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_557| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:06,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:06,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_558|]. (let ((.cse0 (select |v_#memory_int_558| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_558| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:06,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:06,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:06,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:06,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:06,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:06,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:06,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_559|]. (let ((.cse0 (select |v_#memory_int_559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:29:06,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:07,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_560|]. (let ((.cse0 (select |v_#memory_int_560| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_560| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:07,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:07,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_561|]. (let ((.cse0 (select |v_#memory_int_561| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_561| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:07,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:07,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_562|]. (let ((.cse0 (select |v_#memory_int_562| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_562| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:07,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:07,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_563|]. (let ((.cse0 (select |v_#memory_int_563| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_563| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:07,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:07,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_564|]. (let ((.cse0 (select |v_#memory_int_564| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_564| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:07,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:07,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_565|]. (let ((.cse0 (select |v_#memory_int_565| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:07,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:07,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_566|]. (let ((.cse0 (select |v_#memory_int_566| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_566| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:29:07,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:07,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:07,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:07,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:07,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:07,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:07,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_567|]. (let ((.cse0 (select |v_#memory_int_567| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:29:07,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:07,398 INFO L273 TraceCheckUtils]: 0: Hoare triple {5198#true} havoc main_p1; {5198#true} is VALID [2019-05-15 10:29:07,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {5198#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5198#true} is VALID [2019-05-15 10:29:07,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {5198#true} #memory_int := #memory_int[main_p1 := 0]; {5209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:07,400 INFO L273 TraceCheckUtils]: 3: Hoare triple {5209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:07,401 INFO L273 TraceCheckUtils]: 4: Hoare triple {5213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:07,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {5217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:07,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {5221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:07,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {5225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:07,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {5229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:07,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {5233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:07,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {5237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:07,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {5241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:07,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {5245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:07,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {5249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:07,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {5253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:07,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {5257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:07,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {5261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:07,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {5265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:07,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {5269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:07,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {5273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:07,413 INFO L273 TraceCheckUtils]: 20: Hoare triple {5277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:07,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {5281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:07,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {5285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:07,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {5289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:07,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {5293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:07,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {5297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:07,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {5301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:07,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {5305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:07,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {5309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:07,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {5313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:07,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {5317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:07,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {5321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:07,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {5325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:07,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {5329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:07,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {5333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:07,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {5337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} assume !(#memory_int[main_p1] >= 0); {5199#false} is VALID [2019-05-15 10:29:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-15 10:29:07,429 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-05-15 10:29:07,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:07,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2019-05-15 10:29:07,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:07,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-05-15 10:29:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-15 10:29:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-05-15 10:29:07,528 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2019-05-15 10:29:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:10,348 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:10,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-15 10:29:10,348 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-05-15 10:29:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:29:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-05-15 10:29:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-05-15 10:29:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-05-15 10:29:10,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2019-05-15 10:29:10,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:10,383 INFO L225 Difference]: With dead ends: 38 [2019-05-15 10:29:10,383 INFO L226 Difference]: Without dead ends: 38 [2019-05-15 10:29:10,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-05-15 10:29:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-05-15 10:29:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-05-15 10:29:10,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:10,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:10,386 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:10,386 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:10,386 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:10,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:10,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:10,387 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:10,387 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2019-05-15 10:29:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:10,387 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-05-15 10:29:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:10,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:10,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:10,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:10,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-05-15 10:29:10,388 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-05-15 10:29:10,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:10,389 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-05-15 10:29:10,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-05-15 10:29:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-05-15 10:29:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-05-15 10:29:10,389 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:10,389 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-05-15 10:29:10,389 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2069765822, now seen corresponding path program 33 times [2019-05-15 10:29:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:10,403 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-15 10:29:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:10,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:10,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:10,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:10,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_568|]. (= (store |v_#memory_int_568| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:10,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:10,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_569|]. (let ((.cse0 (select |v_#memory_int_569| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_569| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:10,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:10,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_570|]. (let ((.cse0 (select |v_#memory_int_570| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_570| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:29:10,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:10,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_571|]. (let ((.cse0 (select |v_#memory_int_571| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:10,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_572|]. (let ((.cse0 (select |v_#memory_int_572| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:29:10,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:10,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_573|]. (let ((.cse0 (select |v_#memory_int_573| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_573| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:10,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_574|]. (let ((.cse0 (select |v_#memory_int_574| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:10,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_575|]. (let ((.cse0 (select |v_#memory_int_575| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:29:10,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:10,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_576|]. (let ((.cse0 (select |v_#memory_int_576| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:10,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:10,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_577|]. (let ((.cse0 (select |v_#memory_int_577| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_577| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:10,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_578|]. (let ((.cse0 (select |v_#memory_int_578| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_578| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:29:10,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:10,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_579|]. (let ((.cse0 (select |v_#memory_int_579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:29:10,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:10,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_580|]. (let ((.cse0 (select |v_#memory_int_580| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:10,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_581|]. (let ((.cse0 (select |v_#memory_int_581| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_581| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:10,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_582|]. (let ((.cse0 (select |v_#memory_int_582| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:10,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_583|]. (let ((.cse0 (select |v_#memory_int_583| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_583| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:10,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:10,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_584|]. (let ((.cse0 (select |v_#memory_int_584| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:10,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_585|]. (let ((.cse0 (select |v_#memory_int_585| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:10,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:10,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:10,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:10,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:10,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:10,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_586|]. (let ((.cse0 (select |v_#memory_int_586| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:10,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:11,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_587|]. (let ((.cse0 (select |v_#memory_int_587| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_587| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:29:11,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:11,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_588|]. (let ((.cse0 (select |v_#memory_int_588| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:11,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:11,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_589|]. (let ((.cse0 (select |v_#memory_int_589| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_589| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:11,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:11,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_590|]. (let ((.cse0 (select |v_#memory_int_590| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_590| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:29:11,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:11,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_591|]. (let ((.cse0 (select |v_#memory_int_591| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_591| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:11,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_592|]. (let ((.cse0 (select |v_#memory_int_592| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_592| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:11,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_593|]. (let ((.cse0 (select |v_#memory_int_593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:29:11,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:11,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_594|]. (let ((.cse0 (select |v_#memory_int_594| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_594| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:11,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_595|]. (let ((.cse0 (select |v_#memory_int_595| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:11,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:11,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_596|]. (let ((.cse0 (select |v_#memory_int_596| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:11,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:11,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_597|]. (let ((.cse0 (select |v_#memory_int_597| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_597| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:11,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_598|]. (let ((.cse0 (select |v_#memory_int_598| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_598| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:11,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_599|]. (let ((.cse0 (select |v_#memory_int_599| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_599| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:11,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:11,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_600|]. (let ((.cse0 (select |v_#memory_int_600| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_600| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:11,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:11,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:11,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:11,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:11,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:11,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:11,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_601|]. (let ((.cse0 (select |v_#memory_int_601| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_601| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:11,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:11,677 INFO L273 TraceCheckUtils]: 0: Hoare triple {5492#true} havoc main_p1; {5492#true} is VALID [2019-05-15 10:29:11,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {5492#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5492#true} is VALID [2019-05-15 10:29:11,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {5492#true} #memory_int := #memory_int[main_p1 := 0]; {5503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:11,678 INFO L273 TraceCheckUtils]: 3: Hoare triple {5503#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:11,679 INFO L273 TraceCheckUtils]: 4: Hoare triple {5507#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:11,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {5511#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:11,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {5515#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:11,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {5519#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:11,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {5523#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:11,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {5527#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:11,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {5531#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:11,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {5535#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:11,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {5539#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:11,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {5543#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:11,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {5547#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:11,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {5551#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:11,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {5555#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:11,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {5559#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:11,708 INFO L273 TraceCheckUtils]: 18: Hoare triple {5563#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:11,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {5567#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:11,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {5571#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:11,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {5575#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:11,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {5579#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:11,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {5583#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:11,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {5587#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5591#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:11,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {5591#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5595#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:11,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {5595#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5599#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:11,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {5599#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5603#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:11,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {5603#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5607#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:11,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {5607#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5611#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:11,717 INFO L273 TraceCheckUtils]: 30: Hoare triple {5611#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5615#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:11,718 INFO L273 TraceCheckUtils]: 31: Hoare triple {5615#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5619#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:11,718 INFO L273 TraceCheckUtils]: 32: Hoare triple {5619#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5623#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:11,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {5623#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5627#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:11,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {5627#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5631#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:11,721 INFO L273 TraceCheckUtils]: 35: Hoare triple {5631#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5635#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:11,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {5635#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} assume !(#memory_int[main_p1] >= 0); {5493#false} is VALID [2019-05-15 10:29:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:11,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-15 10:29:11,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-05-15 10:29:11,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:11,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2019-05-15 10:29:11,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:11,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-05-15 10:29:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-15 10:29:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:11,757 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2019-05-15 10:29:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:14,294 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-15 10:29:14,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 37 [2019-05-15 10:29:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-05-15 10:29:14,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-05-15 10:29:14,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2019-05-15 10:29:14,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:14,329 INFO L225 Difference]: With dead ends: 39 [2019-05-15 10:29:14,329 INFO L226 Difference]: Without dead ends: 39 [2019-05-15 10:29:14,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-05-15 10:29:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-05-15 10:29:14,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-05-15 10:29:14,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:14,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:14,332 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:14,332 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:14,332 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:14,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:14,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:14,333 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:14,333 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-05-15 10:29:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:14,334 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-05-15 10:29:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:14,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:14,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:14,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:14,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-05-15 10:29:14,335 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-05-15 10:29:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:14,335 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-05-15 10:29:14,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-05-15 10:29:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-05-15 10:29:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-05-15 10:29:14,335 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:14,335 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-05-15 10:29:14,336 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 261768904, now seen corresponding path program 34 times [2019-05-15 10:29:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:14,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-15 10:29:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:14,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:14,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:14,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:14,379 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,379 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_602|]. (= (store |v_#memory_int_602| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:14,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:14,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_603|]. (let ((.cse0 (select |v_#memory_int_603| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_603| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:14,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_604|]. (let ((.cse0 (select |v_#memory_int_604| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:14,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_605|]. (let ((.cse0 (select |v_#memory_int_605| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:29:14,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:14,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_606|]. (let ((.cse0 (select |v_#memory_int_606| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_606| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:14,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_607|]. (let ((.cse0 (select |v_#memory_int_607| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_607| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:14,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:14,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_608|]. (let ((.cse0 (select |v_#memory_int_608| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:29:14,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:14,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_609|]. (let ((.cse0 (select |v_#memory_int_609| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:14,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_610|]. (let ((.cse0 (select |v_#memory_int_610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:29:14,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:14,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_611|]. (let ((.cse0 (select |v_#memory_int_611| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_611| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:14,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_612|]. (let ((.cse0 (select |v_#memory_int_612| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_612| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:14,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:14,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_613|]. (let ((.cse0 (select |v_#memory_int_613| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_613| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:14,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:14,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_614|]. (let ((.cse0 (select |v_#memory_int_614| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:14,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:14,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_615|]. (let ((.cse0 (select |v_#memory_int_615| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_615| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:29:14,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:14,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,739 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_616|]. (let ((.cse0 (select |v_#memory_int_616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:29:14,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:14,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_617|]. (let ((.cse0 (select |v_#memory_int_617| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:29:14,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:14,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_618|]. (let ((.cse0 (select |v_#memory_int_618| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:29:14,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:14,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_619|]. (let ((.cse0 (select |v_#memory_int_619| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_619| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:14,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:14,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_620|]. (let ((.cse0 (select |v_#memory_int_620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:14,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:14,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_621|]. (let ((.cse0 (select |v_#memory_int_621| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_621| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:14,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:14,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_622|]. (let ((.cse0 (select |v_#memory_int_622| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_622| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:29:14,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:14,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:14,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:14,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:14,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:14,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:14,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_623|]. (let ((.cse0 (select |v_#memory_int_623| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_623| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:14,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:15,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_624|]. (let ((.cse0 (select |v_#memory_int_624| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:15,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_625|]. (let ((.cse0 (select |v_#memory_int_625| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_625| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:29:15,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:15,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_626|]. (let ((.cse0 (select |v_#memory_int_626| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_626| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:15,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:15,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_627|]. (let ((.cse0 (select |v_#memory_int_627| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:15,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:15,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,174 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_628|]. (let ((.cse0 (select |v_#memory_int_628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:29:15,174 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:15,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_629|]. (let ((.cse0 (select |v_#memory_int_629| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_629| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:15,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:15,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_630|]. (let ((.cse0 (select |v_#memory_int_630| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_630| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:15,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:15,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_631|]. (let ((.cse0 (select |v_#memory_int_631| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:15,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_632|]. (let ((.cse0 (select |v_#memory_int_632| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:15,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:15,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_633|]. (let ((.cse0 (select |v_#memory_int_633| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_633| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:29:15,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:15,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_634|]. (let ((.cse0 (select |v_#memory_int_634| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:29:15,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:15,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_635|]. (let ((.cse0 (select |v_#memory_int_635| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_635| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:15,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:15,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:15,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:15,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:15,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:15,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:15,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_636|]. (let ((.cse0 (select |v_#memory_int_636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:29:15,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:15,562 INFO L273 TraceCheckUtils]: 0: Hoare triple {5794#true} havoc main_p1; {5794#true} is VALID [2019-05-15 10:29:15,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {5794#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {5794#true} is VALID [2019-05-15 10:29:15,563 INFO L273 TraceCheckUtils]: 2: Hoare triple {5794#true} #memory_int := #memory_int[main_p1 := 0]; {5805#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:15,564 INFO L273 TraceCheckUtils]: 3: Hoare triple {5805#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5809#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:15,564 INFO L273 TraceCheckUtils]: 4: Hoare triple {5809#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5813#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:15,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {5813#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5817#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:15,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {5817#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5821#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:15,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {5821#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5825#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:15,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {5825#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5829#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:15,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {5829#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5833#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:15,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {5833#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5837#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:15,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {5837#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5841#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:15,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {5841#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5845#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:15,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {5845#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5849#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:15,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {5849#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5853#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:15,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {5853#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5857#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:15,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {5857#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5861#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:15,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {5861#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5865#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:15,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {5865#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5869#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:15,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {5869#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5873#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:15,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {5873#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5877#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:15,577 INFO L273 TraceCheckUtils]: 21: Hoare triple {5877#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5881#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:15,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {5881#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5885#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:15,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {5885#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5889#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:15,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {5889#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5893#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:15,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {5893#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5897#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:15,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {5897#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5901#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:15,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {5901#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5905#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:15,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {5905#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5909#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:15,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {5909#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5913#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:15,584 INFO L273 TraceCheckUtils]: 30: Hoare triple {5913#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5917#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:15,585 INFO L273 TraceCheckUtils]: 31: Hoare triple {5917#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5921#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:15,586 INFO L273 TraceCheckUtils]: 32: Hoare triple {5921#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5925#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:15,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {5925#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5929#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:15,587 INFO L273 TraceCheckUtils]: 34: Hoare triple {5929#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5933#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:15,588 INFO L273 TraceCheckUtils]: 35: Hoare triple {5933#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5937#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:15,589 INFO L273 TraceCheckUtils]: 36: Hoare triple {5937#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {5941#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:15,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {5941#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} assume !(#memory_int[main_p1] >= 0); {5795#false} is VALID [2019-05-15 10:29:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-15 10:29:15,593 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-05-15 10:29:15,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:15,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2019-05-15 10:29:15,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:15,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-05-15 10:29:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-15 10:29:15,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-05-15 10:29:15,627 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 37 states. [2019-05-15 10:29:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:18,387 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-15 10:29:18,387 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 38 [2019-05-15 10:29:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-05-15 10:29:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-05-15 10:29:18,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-05-15 10:29:18,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2019-05-15 10:29:18,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:18,424 INFO L225 Difference]: With dead ends: 40 [2019-05-15 10:29:18,424 INFO L226 Difference]: Without dead ends: 40 [2019-05-15 10:29:18,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-05-15 10:29:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-05-15 10:29:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-05-15 10:29:18,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:18,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:18,426 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:18,426 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:18,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:18,427 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:18,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:18,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:18,428 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:18,428 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-05-15 10:29:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:18,429 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-05-15 10:29:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:18,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:18,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:18,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:18,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-05-15 10:29:18,430 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-05-15 10:29:18,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:18,430 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-05-15 10:29:18,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-05-15 10:29:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-05-15 10:29:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-05-15 10:29:18,431 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:18,431 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-05-15 10:29:18,431 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:18,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -475098622, now seen corresponding path program 35 times [2019-05-15 10:29:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:18,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-15 10:29:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:18,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:18,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:18,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:18,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_637|]. (= |#memory_int| (store |v_#memory_int_637| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:18,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:18,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_638|]. (let ((.cse0 (select |v_#memory_int_638| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_638| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:18,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:18,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_639|]. (let ((.cse0 (select |v_#memory_int_639| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_639| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:18,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:18,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_640|]. (let ((.cse0 (select |v_#memory_int_640| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_640| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:29:18,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:18,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,635 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_641|]. (let ((.cse0 (select |v_#memory_int_641| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,635 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:18,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_642|]. (let ((.cse0 (select |v_#memory_int_642| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:18,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_643|]. (let ((.cse0 (select |v_#memory_int_643| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_643| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:29:18,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:18,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_644|]. (let ((.cse0 (select |v_#memory_int_644| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_644| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:18,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_645|]. (let ((.cse0 (select |v_#memory_int_645| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:18,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_646|]. (let ((.cse0 (select |v_#memory_int_646| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_646| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:29:18,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:18,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_647|]. (let ((.cse0 (select |v_#memory_int_647| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_647| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:29:18,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:18,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_648|]. (let ((.cse0 (select |v_#memory_int_648| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:29:18,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:18,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_649|]. (let ((.cse0 (select |v_#memory_int_649| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_649| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:29:18,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:18,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_650|]. (let ((.cse0 (select |v_#memory_int_650| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_650| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:29:18,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:18,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_651|]. (let ((.cse0 (select |v_#memory_int_651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:29:18,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:18,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_652|]. (let ((.cse0 (select |v_#memory_int_652| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_652| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:18,934 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:18,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_653|]. (let ((.cse0 (select |v_#memory_int_653| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:18,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:18,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:18,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:18,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:18,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:18,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_654|]. (let ((.cse0 (select |v_#memory_int_654| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:18,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:19,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_655|]. (let ((.cse0 (select |v_#memory_int_655| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:29:19,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:19,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,070 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_656|]. (let ((.cse0 (select |v_#memory_int_656| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_656| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:29:19,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:19,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_657|]. (let ((.cse0 (select |v_#memory_int_657| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:29:19,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:19,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_658|]. (let ((.cse0 (select |v_#memory_int_658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:29:19,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:19,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_659|]. (let ((.cse0 (select |v_#memory_int_659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:29:19,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:19,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_660|]. (let ((.cse0 (select |v_#memory_int_660| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_660| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:19,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_661|]. (let ((.cse0 (select |v_#memory_int_661| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_661| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:19,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_662|]. (let ((.cse0 (select |v_#memory_int_662| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:19,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_663|]. (let ((.cse0 (select |v_#memory_int_663| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:29:19,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:19,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_664|]. (let ((.cse0 (select |v_#memory_int_664| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_664| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:19,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:19,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_665|]. (let ((.cse0 (select |v_#memory_int_665| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:29:19,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:19,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_666|]. (let ((.cse0 (select |v_#memory_int_666| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:19,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,576 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,576 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_667|]. (let ((.cse0 (select |v_#memory_int_667| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_667| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:19,576 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:19,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_668|]. (let ((.cse0 (select |v_#memory_int_668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:19,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:19,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,669 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,669 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_669|]. (let ((.cse0 (select |v_#memory_int_669| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:19,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_670|]. (let ((.cse0 (select |v_#memory_int_670| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:19,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:19,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,822 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,822 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_671|]. (let ((.cse0 (select |v_#memory_int_671| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:29:19,823 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:19,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:19,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:19,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:19,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:19,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:19,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_672|]. (let ((.cse0 (select |v_#memory_int_672| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:29:19,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:19,904 INFO L273 TraceCheckUtils]: 0: Hoare triple {6104#true} havoc main_p1; {6104#true} is VALID [2019-05-15 10:29:19,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {6104#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6104#true} is VALID [2019-05-15 10:29:19,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {6104#true} #memory_int := #memory_int[main_p1 := 0]; {6115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:19,906 INFO L273 TraceCheckUtils]: 3: Hoare triple {6115#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:19,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {6119#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:19,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {6123#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:19,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {6127#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:19,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {6131#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:19,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {6135#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:19,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {6139#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:19,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {6143#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:19,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {6147#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:19,912 INFO L273 TraceCheckUtils]: 12: Hoare triple {6151#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:19,913 INFO L273 TraceCheckUtils]: 13: Hoare triple {6155#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:19,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {6159#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:19,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {6163#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:19,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {6167#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:19,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {6171#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:19,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {6175#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:19,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {6179#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:19,920 INFO L273 TraceCheckUtils]: 20: Hoare triple {6183#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:19,941 INFO L273 TraceCheckUtils]: 21: Hoare triple {6187#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:19,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {6191#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6195#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:19,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {6195#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6199#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:19,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {6199#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6203#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:19,992 INFO L273 TraceCheckUtils]: 25: Hoare triple {6203#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6207#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:20,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {6207#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6211#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:20,011 INFO L273 TraceCheckUtils]: 27: Hoare triple {6211#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6215#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:20,026 INFO L273 TraceCheckUtils]: 28: Hoare triple {6215#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6219#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:20,035 INFO L273 TraceCheckUtils]: 29: Hoare triple {6219#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6223#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:20,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {6223#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6227#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:20,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {6227#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6231#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:20,071 INFO L273 TraceCheckUtils]: 32: Hoare triple {6231#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6235#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:20,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {6235#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6239#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:20,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {6239#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6243#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:20,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {6243#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6247#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:20,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {6247#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6251#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:20,094 INFO L273 TraceCheckUtils]: 37: Hoare triple {6251#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6255#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:20,097 INFO L273 TraceCheckUtils]: 38: Hoare triple {6255#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} assume !(#memory_int[main_p1] >= 0); {6105#false} is VALID [2019-05-15 10:29:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:20,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:20,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-15 10:29:20,099 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-05-15 10:29:20,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:20,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2019-05-15 10:29:20,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:20,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-05-15 10:29:20,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-15 10:29:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:20,142 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 38 states. [2019-05-15 10:29:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:22,898 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-15 10:29:22,898 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39 [2019-05-15 10:29:22,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-05-15 10:29:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-05-15 10:29:22,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2019-05-15 10:29:22,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:22,933 INFO L225 Difference]: With dead ends: 41 [2019-05-15 10:29:22,934 INFO L226 Difference]: Without dead ends: 41 [2019-05-15 10:29:22,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-05-15 10:29:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-05-15 10:29:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-05-15 10:29:22,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:22,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:22,936 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:22,936 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:22,937 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:22,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:22,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:22,937 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:22,938 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-05-15 10:29:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:22,938 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-05-15 10:29:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:22,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:22,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:22,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:22,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:22,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-05-15 10:29:22,939 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-05-15 10:29:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:22,940 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-05-15 10:29:22,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-05-15 10:29:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-05-15 10:29:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-05-15 10:29:22,940 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:22,940 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-05-15 10:29:22,940 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1843155448, now seen corresponding path program 36 times [2019-05-15 10:29:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:22,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-15 10:29:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:22,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:22,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:22,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:22,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:22,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:22,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:23,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_673|]. (= |#memory_int| (store |v_#memory_int_673| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:23,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:23,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_674|]. (let ((.cse0 (select |v_#memory_int_674| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_674| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:29:23,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:23,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_675|]. (let ((.cse0 (select |v_#memory_int_675| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:29:23,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:23,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_676|]. (let ((.cse0 (select |v_#memory_int_676| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_676| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:23,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_677|]. (let ((.cse0 (select |v_#memory_int_677| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_677| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:29:23,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:23,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_678|]. (let ((.cse0 (select |v_#memory_int_678| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:29:23,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:23,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_679|]. (let ((.cse0 (select |v_#memory_int_679| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_679| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:23,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:23,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_680|]. (let ((.cse0 (select |v_#memory_int_680| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_680| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:29:23,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:23,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_681|]. (let ((.cse0 (select |v_#memory_int_681| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:29:23,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:23,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_682|]. (let ((.cse0 (select |v_#memory_int_682| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_682| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:23,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_683|]. (let ((.cse0 (select |v_#memory_int_683| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_683| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:23,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:23,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_684|]. (let ((.cse0 (select |v_#memory_int_684| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_684| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:23,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_685|]. (let ((.cse0 (select |v_#memory_int_685| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_685| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:23,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_686|]. (let ((.cse0 (select |v_#memory_int_686| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:23,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:23,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_687|]. (let ((.cse0 (select |v_#memory_int_687| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_687| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:29:23,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:23,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_688|]. (let ((.cse0 (select |v_#memory_int_688| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_688| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:29:23,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:23,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_689|]. (let ((.cse0 (select |v_#memory_int_689| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_689| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:23,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_690|]. (let ((.cse0 (select |v_#memory_int_690| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_690| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:23,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:23,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_691|]. (let ((.cse0 (select |v_#memory_int_691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:23,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:23,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_692|]. (let ((.cse0 (select |v_#memory_int_692| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:23,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:23,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_693|]. (let ((.cse0 (select |v_#memory_int_693| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_693| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:23,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_694|]. (let ((.cse0 (select |v_#memory_int_694| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:23,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:23,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_695|]. (let ((.cse0 (select |v_#memory_int_695| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:29:23,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:23,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_696|]. (let ((.cse0 (select |v_#memory_int_696| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_696| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:23,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:23,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_697|]. (let ((.cse0 (select |v_#memory_int_697| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:29:23,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:23,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_698|]. (let ((.cse0 (select |v_#memory_int_698| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_698| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:29:23,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:23,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:23,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:23,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:23,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:23,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:23,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_699|]. (let ((.cse0 (select |v_#memory_int_699| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_699| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:23,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:24,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_700|]. (let ((.cse0 (select |v_#memory_int_700| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:29:24,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:24,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_701|]. (let ((.cse0 (select |v_#memory_int_701| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_701| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:24,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:24,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_702|]. (let ((.cse0 (select |v_#memory_int_702| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:24,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_703|]. (let ((.cse0 (select |v_#memory_int_703| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_703| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:24,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:24,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_704|]. (let ((.cse0 (select |v_#memory_int_704| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:24,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:24,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_705|]. (let ((.cse0 (select |v_#memory_int_705| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:24,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:24,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_706|]. (let ((.cse0 (select |v_#memory_int_706| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:24,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:24,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_707|]. (let ((.cse0 (select |v_#memory_int_707| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_707| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:24,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:24,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_708|]. (let ((.cse0 (select |v_#memory_int_708| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_708| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:29:24,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:24,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:24,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:24,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:24,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:24,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:24,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_709|]. (let ((.cse0 (select |v_#memory_int_709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:29:24,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:24,475 INFO L273 TraceCheckUtils]: 0: Hoare triple {6422#true} havoc main_p1; {6422#true} is VALID [2019-05-15 10:29:24,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {6422#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6422#true} is VALID [2019-05-15 10:29:24,476 INFO L273 TraceCheckUtils]: 2: Hoare triple {6422#true} #memory_int := #memory_int[main_p1 := 0]; {6433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:24,477 INFO L273 TraceCheckUtils]: 3: Hoare triple {6433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6437#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:24,496 INFO L273 TraceCheckUtils]: 4: Hoare triple {6437#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6441#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:24,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {6441#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6445#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:24,518 INFO L273 TraceCheckUtils]: 6: Hoare triple {6445#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6449#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:24,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {6449#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6453#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:24,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {6453#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6457#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:24,547 INFO L273 TraceCheckUtils]: 9: Hoare triple {6457#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6461#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:24,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {6461#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6465#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:24,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {6465#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6469#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:24,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {6469#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6473#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:24,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {6473#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6477#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:24,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {6477#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6481#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:24,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {6481#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6485#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:24,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {6485#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6489#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:24,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {6489#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6493#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:24,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {6493#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6497#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:24,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {6497#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6501#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:24,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {6501#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6505#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:24,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {6505#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6509#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:24,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {6509#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6513#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:24,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {6513#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6517#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:24,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {6517#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6521#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:24,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {6521#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6525#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:24,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {6525#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6529#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:24,590 INFO L273 TraceCheckUtils]: 27: Hoare triple {6529#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6533#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:24,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {6533#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6537#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:24,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {6537#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6541#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:24,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {6541#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6545#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:24,593 INFO L273 TraceCheckUtils]: 31: Hoare triple {6545#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6549#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:24,594 INFO L273 TraceCheckUtils]: 32: Hoare triple {6549#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6553#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:24,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {6553#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6557#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:24,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {6557#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6561#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:24,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {6561#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6565#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:24,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {6565#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6569#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:24,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6573#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:24,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {6573#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6577#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:24,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {6577#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} assume !(#memory_int[main_p1] >= 0); {6423#false} is VALID [2019-05-15 10:29:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:24,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-15 10:29:24,603 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-05-15 10:29:24,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:24,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2019-05-15 10:29:24,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:24,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-05-15 10:29:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-15 10:29:24,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-05-15 10:29:24,637 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 39 states. [2019-05-15 10:29:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:27,585 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-15 10:29:27,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 40 [2019-05-15 10:29:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-05-15 10:29:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-05-15 10:29:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-05-15 10:29:27,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2019-05-15 10:29:27,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:27,626 INFO L225 Difference]: With dead ends: 42 [2019-05-15 10:29:27,626 INFO L226 Difference]: Without dead ends: 42 [2019-05-15 10:29:27,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-05-15 10:29:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-05-15 10:29:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-05-15 10:29:27,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:27,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:27,629 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:27,630 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:27,630 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:27,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:27,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:27,631 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:27,631 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2019-05-15 10:29:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:27,632 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-05-15 10:29:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:27,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:27,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:27,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:27,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-05-15 10:29:27,633 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-05-15 10:29:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:27,633 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-05-15 10:29:27,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-05-15 10:29:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-05-15 10:29:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-05-15 10:29:27,634 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:27,634 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-05-15 10:29:27,634 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1303244094, now seen corresponding path program 37 times [2019-05-15 10:29:27,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:27,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-15 10:29:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:27,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:27,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:27,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:27,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_710|]. (= |#memory_int| (store |v_#memory_int_710| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:27,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:27,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_711|]. (let ((.cse0 (select |v_#memory_int_711| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_711| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:27,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:27,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_712|]. (let ((.cse0 (select |v_#memory_int_712| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_712| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:29:27,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:27,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_713|]. (let ((.cse0 (select |v_#memory_int_713| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_713| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:29:27,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:27,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_714|]. (let ((.cse0 (select |v_#memory_int_714| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:27,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:27,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_715|]. (let ((.cse0 (select |v_#memory_int_715| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:27,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:27,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_716|]. (let ((.cse0 (select |v_#memory_int_716| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_716| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:27,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:27,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_717|]. (let ((.cse0 (select |v_#memory_int_717| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:27,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:27,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_718|]. (let ((.cse0 (select |v_#memory_int_718| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:27,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:27,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_719|]. (let ((.cse0 (select |v_#memory_int_719| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:27,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:27,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_720|]. (let ((.cse0 (select |v_#memory_int_720| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_720| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:27,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:27,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_721|]. (let ((.cse0 (select |v_#memory_int_721| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_721| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:27,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:27,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:27,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:27,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:27,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:27,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:27,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_722|]. (let ((.cse0 (select |v_#memory_int_722| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_722| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:27,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:28,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_723|]. (let ((.cse0 (select |v_#memory_int_723| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_723| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:28,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_724|]. (let ((.cse0 (select |v_#memory_int_724| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:28,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_725|]. (let ((.cse0 (select |v_#memory_int_725| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:29:28,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:28,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_726|]. (let ((.cse0 (select |v_#memory_int_726| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_726| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:28,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:28,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_727|]. (let ((.cse0 (select |v_#memory_int_727| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_727| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:28,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:28,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_728|]. (let ((.cse0 (select |v_#memory_int_728| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_728| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:28,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:28,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_729|]. (let ((.cse0 (select |v_#memory_int_729| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:28,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_730|]. (let ((.cse0 (select |v_#memory_int_730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:28,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:28,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_731|]. (let ((.cse0 (select |v_#memory_int_731| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:28,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:28,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_732|]. (let ((.cse0 (select |v_#memory_int_732| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_732| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:28,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:28,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_733|]. (let ((.cse0 (select |v_#memory_int_733| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_733| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:28,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_734|]. (let ((.cse0 (select |v_#memory_int_734| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:28,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_735|]. (let ((.cse0 (select |v_#memory_int_735| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_735| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:29:28,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:28,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_736|]. (let ((.cse0 (select |v_#memory_int_736| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:29:28,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:28,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_737|]. (let ((.cse0 (select |v_#memory_int_737| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_737| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:28,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:28,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_738|]. (let ((.cse0 (select |v_#memory_int_738| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:28,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:28,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_739|]. (let ((.cse0 (select |v_#memory_int_739| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_739| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:28,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:28,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:28,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:28,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_740|]. (let ((.cse0 (select |v_#memory_int_740| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_740| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:28,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:28,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:28,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:28,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:28,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_741|]. (let ((.cse0 (select |v_#memory_int_741| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:29,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,056 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_742|]. (let ((.cse0 (select |v_#memory_int_742| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_742| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:29:29,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:29,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_743|]. (let ((.cse0 (select |v_#memory_int_743| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_743| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:29:29,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:29,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_744|]. (let ((.cse0 (select |v_#memory_int_744| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_744| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:29,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_745|]. (let ((.cse0 (select |v_#memory_int_745| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:29,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_746|]. (let ((.cse0 (select |v_#memory_int_746| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:29,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:29,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:29,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:29,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:29,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:29,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:29,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_747|]. (let ((.cse0 (select |v_#memory_int_747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:29:29,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:29,323 INFO L273 TraceCheckUtils]: 0: Hoare triple {6748#true} havoc main_p1; {6748#true} is VALID [2019-05-15 10:29:29,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {6748#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {6748#true} is VALID [2019-05-15 10:29:29,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {6748#true} #memory_int := #memory_int[main_p1 := 0]; {6759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:29,324 INFO L273 TraceCheckUtils]: 3: Hoare triple {6759#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:29,325 INFO L273 TraceCheckUtils]: 4: Hoare triple {6763#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:29,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {6767#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:29,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {6771#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:29,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {6775#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:29,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {6779#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:29,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {6783#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:29,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {6787#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:29,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {6791#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:29,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {6795#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:29,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {6799#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:29,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {6803#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:29,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {6807#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:29,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {6811#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:29,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {6815#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:29,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {6819#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:29,337 INFO L273 TraceCheckUtils]: 19: Hoare triple {6823#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:29,337 INFO L273 TraceCheckUtils]: 20: Hoare triple {6827#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6831#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:29,338 INFO L273 TraceCheckUtils]: 21: Hoare triple {6831#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6835#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:29,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {6835#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6839#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:29,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {6839#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6843#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:29,340 INFO L273 TraceCheckUtils]: 24: Hoare triple {6843#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6847#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:29,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {6847#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6851#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:29,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {6851#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6855#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:29,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {6855#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6859#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:29,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {6859#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6863#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:29,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {6863#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6867#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:29,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {6867#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6871#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:29,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {6871#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6875#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:29,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {6875#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6879#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:29,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {6879#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6883#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:29,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {6883#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6887#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:29,349 INFO L273 TraceCheckUtils]: 35: Hoare triple {6887#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6891#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:29,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {6891#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6895#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:29,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {6895#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6899#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:29,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {6899#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6903#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:29,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {6903#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {6907#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:29,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {6907#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} assume !(#memory_int[main_p1] >= 0); {6749#false} is VALID [2019-05-15 10:29:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:29,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:29,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-15 10:29:29,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-05-15 10:29:29,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:29,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2019-05-15 10:29:29,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:29,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-05-15 10:29:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-15 10:29:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:29,391 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 40 states. [2019-05-15 10:29:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:32,474 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-15 10:29:32,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-05-15 10:29:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-05-15 10:29:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-05-15 10:29:32,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2019-05-15 10:29:32,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:32,514 INFO L225 Difference]: With dead ends: 43 [2019-05-15 10:29:32,514 INFO L226 Difference]: Without dead ends: 43 [2019-05-15 10:29:32,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-05-15 10:29:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-05-15 10:29:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-05-15 10:29:32,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:32,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:32,517 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:32,517 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:32,517 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:32,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:32,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:32,518 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:32,518 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-05-15 10:29:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:32,519 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-05-15 10:29:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:32,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:32,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:32,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-05-15 10:29:32,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-05-15 10:29:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:32,521 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-05-15 10:29:32,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-05-15 10:29:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-05-15 10:29:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-05-15 10:29:32,522 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:32,522 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-05-15 10:29:32,522 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1745861304, now seen corresponding path program 38 times [2019-05-15 10:29:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:32,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-15 10:29:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:32,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:32,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:32,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:32,583 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_748|]. (= (store |v_#memory_int_748| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:32,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:32,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_749|]. (let ((.cse0 (select |v_#memory_int_749| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:32,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:32,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_750|]. (let ((.cse0 (select |v_#memory_int_750| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:29:32,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:32,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_751|]. (let ((.cse0 (select |v_#memory_int_751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:29:32,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:32,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_752|]. (let ((.cse0 (select |v_#memory_int_752| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_752| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:32,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:32,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_753|]. (let ((.cse0 (select |v_#memory_int_753| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_753| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:32,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:32,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_754|]. (let ((.cse0 (select |v_#memory_int_754| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_754| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:29:32,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:32,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_755|]. (let ((.cse0 (select |v_#memory_int_755| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_755| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:29:32,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:32,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_756|]. (let ((.cse0 (select |v_#memory_int_756| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_756| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:29:32,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:32,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_757|]. (let ((.cse0 (select |v_#memory_int_757| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:29:32,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:32,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_758|]. (let ((.cse0 (select |v_#memory_int_758| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_758| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:29:32,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:32,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_759|]. (let ((.cse0 (select |v_#memory_int_759| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_759| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:32,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:32,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_760|]. (let ((.cse0 (select |v_#memory_int_760| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:29:32,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:32,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_761|]. (let ((.cse0 (select |v_#memory_int_761| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:29:32,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:32,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_762|]. (let ((.cse0 (select |v_#memory_int_762| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_762| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:29:32,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:32,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:32,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:32,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_763|]. (let ((.cse0 (select |v_#memory_int_763| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_763| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:29:32,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:32,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:32,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:32,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:32,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_764|]. (let ((.cse0 (select |v_#memory_int_764| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:33,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_765|]. (let ((.cse0 (select |v_#memory_int_765| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:29:33,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:33,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_766|]. (let ((.cse0 (select |v_#memory_int_766| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_766| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:29:33,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:33,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_767|]. (let ((.cse0 (select |v_#memory_int_767| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_767| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:29:33,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:33,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_768|]. (let ((.cse0 (select |v_#memory_int_768| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:29:33,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:33,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_769|]. (let ((.cse0 (select |v_#memory_int_769| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_769| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:33,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_770|]. (let ((.cse0 (select |v_#memory_int_770| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_770| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:29:33,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:33,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_771|]. (let ((.cse0 (select |v_#memory_int_771| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:33,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_772|]. (let ((.cse0 (select |v_#memory_int_772| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_772| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:29:33,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:33,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_773|]. (let ((.cse0 (select |v_#memory_int_773| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_773| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:33,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:33,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_774|]. (let ((.cse0 (select |v_#memory_int_774| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_774| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:33,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_775|]. (let ((.cse0 (select |v_#memory_int_775| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:29:33,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:33,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_776|]. (let ((.cse0 (select |v_#memory_int_776| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:33,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_777|]. (let ((.cse0 (select |v_#memory_int_777| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_777| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:33,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:33,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_778|]. (let ((.cse0 (select |v_#memory_int_778| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:33,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_779|]. (let ((.cse0 (select |v_#memory_int_779| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_779| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:29:33,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:33,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_780|]. (let ((.cse0 (select |v_#memory_int_780| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_780| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:29:33,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:33,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_781|]. (let ((.cse0 (select |v_#memory_int_781| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_781| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:33,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:33,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_782|]. (let ((.cse0 (select |v_#memory_int_782| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:33,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:33,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:33,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:33,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:33,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:33,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_783|]. (let ((.cse0 (select |v_#memory_int_783| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:33,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:34,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_784|]. (let ((.cse0 (select |v_#memory_int_784| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_784| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:34,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,107 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_785|]. (let ((.cse0 (select |v_#memory_int_785| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:29:34,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:34,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:34,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:34,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:34,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:34,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:34,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_786|]. (let ((.cse0 (select |v_#memory_int_786| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:34,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:34,276 INFO L273 TraceCheckUtils]: 0: Hoare triple {7082#true} havoc main_p1; {7082#true} is VALID [2019-05-15 10:29:34,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {7082#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7082#true} is VALID [2019-05-15 10:29:34,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {7082#true} #memory_int := #memory_int[main_p1 := 0]; {7093#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:34,278 INFO L273 TraceCheckUtils]: 3: Hoare triple {7093#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7097#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:34,278 INFO L273 TraceCheckUtils]: 4: Hoare triple {7097#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7101#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:34,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {7101#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7105#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:34,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {7105#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7109#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:34,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {7109#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7113#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:34,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {7113#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7117#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:34,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {7117#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7121#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:34,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {7121#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7125#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:34,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {7125#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7129#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:34,283 INFO L273 TraceCheckUtils]: 12: Hoare triple {7129#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7133#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:34,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {7133#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7137#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:34,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {7137#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7141#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:34,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {7141#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7145#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:34,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {7145#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7149#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:34,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {7149#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7153#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:34,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {7153#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7157#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:34,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {7157#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7161#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:34,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {7161#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7165#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:34,291 INFO L273 TraceCheckUtils]: 21: Hoare triple {7165#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7169#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:34,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {7169#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7173#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:34,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {7173#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7177#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:34,294 INFO L273 TraceCheckUtils]: 24: Hoare triple {7177#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7181#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:34,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {7181#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7185#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:34,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {7185#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7189#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:34,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {7189#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7193#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:34,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {7193#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7197#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:34,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {7197#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7201#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:34,299 INFO L273 TraceCheckUtils]: 30: Hoare triple {7201#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7205#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:34,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {7205#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7209#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:34,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {7209#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7213#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:34,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {7213#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7217#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:34,302 INFO L273 TraceCheckUtils]: 34: Hoare triple {7217#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7221#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:34,303 INFO L273 TraceCheckUtils]: 35: Hoare triple {7221#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7225#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:34,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {7225#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7229#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:34,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {7229#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7233#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:34,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {7233#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7237#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:34,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {7237#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7241#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:34,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {7241#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7245#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:34,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {7245#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} assume !(#memory_int[main_p1] >= 0); {7083#false} is VALID [2019-05-15 10:29:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:34,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-15 10:29:34,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-05-15 10:29:34,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:34,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2019-05-15 10:29:34,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:34,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-05-15 10:29:34,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-15 10:29:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-05-15 10:29:34,354 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 41 states. [2019-05-15 10:29:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:37,641 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-15 10:29:37,641 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 42 [2019-05-15 10:29:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-05-15 10:29:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-05-15 10:29:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-05-15 10:29:37,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2019-05-15 10:29:37,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:37,686 INFO L225 Difference]: With dead ends: 44 [2019-05-15 10:29:37,686 INFO L226 Difference]: Without dead ends: 44 [2019-05-15 10:29:37,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-05-15 10:29:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-05-15 10:29:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-05-15 10:29:37,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:37,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:37,688 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:37,688 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:37,689 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:37,690 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:37,690 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-05-15 10:29:37,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:37,691 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-05-15 10:29:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:37,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:37,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:37,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:37,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-05-15 10:29:37,692 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-05-15 10:29:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:37,693 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-05-15 10:29:37,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-05-15 10:29:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-05-15 10:29:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-05-15 10:29:37,693 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:37,694 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-05-15 10:29:37,694 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:37,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1712874370, now seen corresponding path program 39 times [2019-05-15 10:29:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:37,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-15 10:29:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:37,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:37,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:37,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:37,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_787|]. (= |#memory_int| (store |v_#memory_int_787| ULTIMATE.start_main_p1 0)) [2019-05-15 10:29:37,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:37,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_788|]. (let ((.cse0 (select |v_#memory_int_788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:29:37,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:37,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_789|]. (let ((.cse0 (select |v_#memory_int_789| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_789| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:29:37,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:37,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_790|]. (let ((.cse0 (select |v_#memory_int_790| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_790| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:37,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:37,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_791|]. (let ((.cse0 (select |v_#memory_int_791| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_791| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:37,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:37,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_792|]. (let ((.cse0 (select |v_#memory_int_792| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:29:37,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:37,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:37,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:37,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_793|]. (let ((.cse0 (select |v_#memory_int_793| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_793| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:29:37,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:38,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_794|]. (let ((.cse0 (select |v_#memory_int_794| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_794| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:29:38,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:38,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_795|]. (let ((.cse0 (select |v_#memory_int_795| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:29:38,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:38,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_796|]. (let ((.cse0 (select |v_#memory_int_796| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_796| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:29:38,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:38,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_797|]. (let ((.cse0 (select |v_#memory_int_797| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:38,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_798|]. (let ((.cse0 (select |v_#memory_int_798| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_798| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:38,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:38,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,182 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_799|]. (let ((.cse0 (select |v_#memory_int_799| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:38,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_800|]. (let ((.cse0 (select |v_#memory_int_800| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_800| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:38,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_801|]. (let ((.cse0 (select |v_#memory_int_801| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:38,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_802|]. (let ((.cse0 (select |v_#memory_int_802| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:29:38,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:38,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_803|]. (let ((.cse0 (select |v_#memory_int_803| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_803| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:29:38,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:38,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_804|]. (let ((.cse0 (select |v_#memory_int_804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:38,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:38,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_805|]. (let ((.cse0 (select |v_#memory_int_805| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_805| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:29:38,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:38,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_806|]. (let ((.cse0 (select |v_#memory_int_806| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:38,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_807|]. (let ((.cse0 (select |v_#memory_int_807| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:38,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_808|]. (let ((.cse0 (select |v_#memory_int_808| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:38,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:38,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_809|]. (let ((.cse0 (select |v_#memory_int_809| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_809| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:38,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:38,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_810|]. (let ((.cse0 (select |v_#memory_int_810| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_810| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:38,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:38,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_811|]. (let ((.cse0 (select |v_#memory_int_811| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_811| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:29:38,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:38,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_812|]. (let ((.cse0 (select |v_#memory_int_812| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:38,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:38,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_813|]. (let ((.cse0 (select |v_#memory_int_813| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_813| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:29:38,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:38,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_814|]. (let ((.cse0 (select |v_#memory_int_814| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_814| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:29:38,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:38,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_815|]. (let ((.cse0 (select |v_#memory_int_815| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_815| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:38,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:38,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:38,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:38,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:38,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:38,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_816|]. (let ((.cse0 (select |v_#memory_int_816| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_816| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:29:38,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:39,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_817|]. (let ((.cse0 (select |v_#memory_int_817| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:29:39,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:39,072 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,083 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_818|]. (let ((.cse0 (select |v_#memory_int_818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:29:39,083 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:39,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_819|]. (let ((.cse0 (select |v_#memory_int_819| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:39,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:39,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_820|]. (let ((.cse0 (select |v_#memory_int_820| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:39,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_821|]. (let ((.cse0 (select |v_#memory_int_821| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:39,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_822|]. (let ((.cse0 (select |v_#memory_int_822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:29:39,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:39,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_823|]. (let ((.cse0 (select |v_#memory_int_823| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:39,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:39,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_824|]. (let ((.cse0 (select |v_#memory_int_824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:29:39,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:39,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_825|]. (let ((.cse0 (select |v_#memory_int_825| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:39,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:39,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:39,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:39,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:39,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:39,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_826|]. (let ((.cse0 (select |v_#memory_int_826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:29:39,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:39,509 INFO L273 TraceCheckUtils]: 0: Hoare triple {7424#true} havoc main_p1; {7424#true} is VALID [2019-05-15 10:29:39,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {7424#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7424#true} is VALID [2019-05-15 10:29:39,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {7424#true} #memory_int := #memory_int[main_p1 := 0]; {7435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:39,511 INFO L273 TraceCheckUtils]: 3: Hoare triple {7435#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:39,511 INFO L273 TraceCheckUtils]: 4: Hoare triple {7439#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:39,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {7443#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:39,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {7447#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:39,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {7451#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:39,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {7455#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:39,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {7459#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:39,516 INFO L273 TraceCheckUtils]: 10: Hoare triple {7463#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:39,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {7467#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:39,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {7471#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:39,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {7475#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:39,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {7479#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:39,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {7483#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:39,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {7487#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:39,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {7491#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:39,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {7495#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7499#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:39,522 INFO L273 TraceCheckUtils]: 19: Hoare triple {7499#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7503#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:39,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {7503#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7507#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:39,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {7507#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7511#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:39,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {7511#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7515#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:39,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {7515#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7519#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:39,526 INFO L273 TraceCheckUtils]: 24: Hoare triple {7519#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7523#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:39,527 INFO L273 TraceCheckUtils]: 25: Hoare triple {7523#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7527#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:39,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {7527#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7531#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:39,528 INFO L273 TraceCheckUtils]: 27: Hoare triple {7531#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7535#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:39,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {7535#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7539#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:39,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {7539#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7543#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:39,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {7543#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7547#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:39,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {7547#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7551#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:39,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {7551#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7555#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:39,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {7555#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7559#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:39,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {7559#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7563#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:39,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {7563#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7567#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:39,536 INFO L273 TraceCheckUtils]: 36: Hoare triple {7567#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7571#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:39,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {7571#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7575#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:39,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {7575#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7579#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:39,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {7579#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7583#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:39,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {7583#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7587#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:39,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {7587#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7591#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:39,540 INFO L273 TraceCheckUtils]: 42: Hoare triple {7591#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} assume !(#memory_int[main_p1] >= 0); {7425#false} is VALID [2019-05-15 10:29:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:39,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-15 10:29:39,545 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-05-15 10:29:39,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:39,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2019-05-15 10:29:39,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:39,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-05-15 10:29:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-15 10:29:39,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:39,580 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 42 states. [2019-05-15 10:29:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:43,003 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-15 10:29:43,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 43 [2019-05-15 10:29:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-05-15 10:29:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-05-15 10:29:43,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2019-05-15 10:29:43,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:43,059 INFO L225 Difference]: With dead ends: 45 [2019-05-15 10:29:43,059 INFO L226 Difference]: Without dead ends: 45 [2019-05-15 10:29:43,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-05-15 10:29:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-05-15 10:29:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-05-15 10:29:43,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:43,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:43,061 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:43,061 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:43,062 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:43,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:43,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:43,062 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:43,062 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-05-15 10:29:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:43,063 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-05-15 10:29:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:43,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:43,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:43,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:43,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:29:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-05-15 10:29:43,064 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-05-15 10:29:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:43,065 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-05-15 10:29:43,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-05-15 10:29:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-05-15 10:29:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-05-15 10:29:43,065 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:43,065 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-05-15 10:29:43,065 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1559497864, now seen corresponding path program 40 times [2019-05-15 10:29:43,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:43,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-15 10:29:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:43,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:43,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:43,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:43,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_827|]. (= (store |v_#memory_int_827| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:43,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:43,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_828|]. (let ((.cse0 (select |v_#memory_int_828| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:29:43,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:43,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_829|]. (let ((.cse0 (select |v_#memory_int_829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:29:43,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:43,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,460 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_830|]. (let ((.cse0 (select |v_#memory_int_830| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:29:43,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:43,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_831|]. (let ((.cse0 (select |v_#memory_int_831| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_831| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:43,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:43,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_832|]. (let ((.cse0 (select |v_#memory_int_832| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:43,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:43,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_833|]. (let ((.cse0 (select |v_#memory_int_833| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:43,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_834|]. (let ((.cse0 (select |v_#memory_int_834| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_834| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:43,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_835|]. (let ((.cse0 (select |v_#memory_int_835| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:43,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_836|]. (let ((.cse0 (select |v_#memory_int_836| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_836| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:43,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:43,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_837|]. (let ((.cse0 (select |v_#memory_int_837| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:43,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_838|]. (let ((.cse0 (select |v_#memory_int_838| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:43,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_839|]. (let ((.cse0 (select |v_#memory_int_839| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_839| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:43,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:43,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:43,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:43,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:43,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:43,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_840|]. (let ((.cse0 (select |v_#memory_int_840| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_840| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:43,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:44,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_841|]. (let ((.cse0 (select |v_#memory_int_841| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:29:44,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:44,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_842|]. (let ((.cse0 (select |v_#memory_int_842| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:44,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_843|]. (let ((.cse0 (select |v_#memory_int_843| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:44,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_844|]. (let ((.cse0 (select |v_#memory_int_844| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_844| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:29:44,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:44,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_845|]. (let ((.cse0 (select |v_#memory_int_845| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_845| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:44,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_846|]. (let ((.cse0 (select |v_#memory_int_846| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_846| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:29:44,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:44,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_847|]. (let ((.cse0 (select |v_#memory_int_847| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_847| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:44,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_848|]. (let ((.cse0 (select |v_#memory_int_848| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_848| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:44,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:44,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_849|]. (let ((.cse0 (select |v_#memory_int_849| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_849| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:44,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_850|]. (let ((.cse0 (select |v_#memory_int_850| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:44,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,371 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_851|]. (let ((.cse0 (select |v_#memory_int_851| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_851| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:44,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,415 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,415 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_852|]. (let ((.cse0 (select |v_#memory_int_852| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:44,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:44,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_853|]. (let ((.cse0 (select |v_#memory_int_853| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_853| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:44,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_854|]. (let ((.cse0 (select |v_#memory_int_854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:29:44,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:44,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_855|]. (let ((.cse0 (select |v_#memory_int_855| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_855| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:29:44,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:44,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_856|]. (let ((.cse0 (select |v_#memory_int_856| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:44,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_857|]. (let ((.cse0 (select |v_#memory_int_857| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_857| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:44,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_858|]. (let ((.cse0 (select |v_#memory_int_858| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:29:44,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:44,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_859|]. (let ((.cse0 (select |v_#memory_int_859| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:44,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_860|]. (let ((.cse0 (select |v_#memory_int_860| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:44,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:44,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_861|]. (let ((.cse0 (select |v_#memory_int_861| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_861| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:44,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_862|]. (let ((.cse0 (select |v_#memory_int_862| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_862| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:44,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_863|]. (let ((.cse0 (select |v_#memory_int_863| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_863| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:44,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:44,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_864|]. (let ((.cse0 (select |v_#memory_int_864| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_864| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:29:44,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:44,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:44,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:44,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:44,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:44,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:44,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_865|]. (let ((.cse0 (select |v_#memory_int_865| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_865| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:29:44,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:45,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_866|]. (let ((.cse0 (select |v_#memory_int_866| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:45,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:45,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:45,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:45,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:45,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:45,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:45,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_867|]. (let ((.cse0 (select |v_#memory_int_867| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:45,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:29:45,142 INFO L273 TraceCheckUtils]: 0: Hoare triple {7774#true} havoc main_p1; {7774#true} is VALID [2019-05-15 10:29:45,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {7774#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {7774#true} is VALID [2019-05-15 10:29:45,143 INFO L273 TraceCheckUtils]: 2: Hoare triple {7774#true} #memory_int := #memory_int[main_p1 := 0]; {7785#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:45,143 INFO L273 TraceCheckUtils]: 3: Hoare triple {7785#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7789#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:45,144 INFO L273 TraceCheckUtils]: 4: Hoare triple {7789#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7793#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:45,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {7793#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7797#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:45,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {7797#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7801#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:45,146 INFO L273 TraceCheckUtils]: 7: Hoare triple {7801#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7805#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:45,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {7805#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7809#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:45,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {7809#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7813#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:45,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {7813#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7817#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:45,149 INFO L273 TraceCheckUtils]: 11: Hoare triple {7817#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7821#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:45,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {7821#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7825#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:45,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {7825#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7829#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:45,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {7829#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7833#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:45,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {7833#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7837#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:45,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {7837#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7841#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:45,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {7841#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7845#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:45,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {7845#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7849#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:45,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {7849#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7853#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:45,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {7853#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7857#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:45,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {7857#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7861#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:45,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {7861#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7865#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:45,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {7865#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7869#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:45,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {7869#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7873#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:45,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {7873#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7877#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:45,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {7877#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7881#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:45,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {7881#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7885#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:45,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {7885#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7889#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:45,163 INFO L273 TraceCheckUtils]: 29: Hoare triple {7889#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7893#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:45,164 INFO L273 TraceCheckUtils]: 30: Hoare triple {7893#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7897#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:45,164 INFO L273 TraceCheckUtils]: 31: Hoare triple {7897#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7901#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:45,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {7901#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7905#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:45,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {7905#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7909#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:45,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {7909#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7913#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:45,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {7913#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7917#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:45,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {7917#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7921#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:45,169 INFO L273 TraceCheckUtils]: 37: Hoare triple {7921#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7925#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:45,170 INFO L273 TraceCheckUtils]: 38: Hoare triple {7925#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7929#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:45,171 INFO L273 TraceCheckUtils]: 39: Hoare triple {7929#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7933#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:45,171 INFO L273 TraceCheckUtils]: 40: Hoare triple {7933#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7937#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:45,172 INFO L273 TraceCheckUtils]: 41: Hoare triple {7937#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7941#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:45,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {7941#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {7945#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:29:45,173 INFO L273 TraceCheckUtils]: 43: Hoare triple {7945#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} assume !(#memory_int[main_p1] >= 0); {7775#false} is VALID [2019-05-15 10:29:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:45,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-15 10:29:45,178 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-05-15 10:29:45,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:45,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2019-05-15 10:29:45,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:45,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-05-15 10:29:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-15 10:29:45,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-05-15 10:29:45,216 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 43 states. [2019-05-15 10:29:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:48,877 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-15 10:29:48,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 44 [2019-05-15 10:29:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-05-15 10:29:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-05-15 10:29:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-05-15 10:29:48,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2019-05-15 10:29:48,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:48,925 INFO L225 Difference]: With dead ends: 46 [2019-05-15 10:29:48,925 INFO L226 Difference]: Without dead ends: 46 [2019-05-15 10:29:48,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-05-15 10:29:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-05-15 10:29:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-05-15 10:29:48,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:48,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:48,927 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:48,927 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:48,928 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:48,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:48,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:48,928 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:48,928 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2019-05-15 10:29:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:48,929 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-05-15 10:29:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:48,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:48,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:48,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:48,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:29:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-05-15 10:29:48,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-05-15 10:29:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:48,930 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-05-15 10:29:48,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-05-15 10:29:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-05-15 10:29:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-05-15 10:29:48,931 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:48,931 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-05-15 10:29:48,931 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1099793474, now seen corresponding path program 41 times [2019-05-15 10:29:48,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:48,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-15 10:29:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:48,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:49,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:49,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:49,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_868|]. (= (store |v_#memory_int_868| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:49,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:49,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_869|]. (let ((.cse0 (select |v_#memory_int_869| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:49,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:49,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_870|]. (let ((.cse0 (select |v_#memory_int_870| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_870| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:49,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:49,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_871|]. (let ((.cse0 (select |v_#memory_int_871| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_871| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:49,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:49,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_872|]. (let ((.cse0 (select |v_#memory_int_872| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_872| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:29:49,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:49,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_873|]. (let ((.cse0 (select |v_#memory_int_873| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_873| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:29:49,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:49,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_874|]. (let ((.cse0 (select |v_#memory_int_874| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:29:49,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:49,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_875|]. (let ((.cse0 (select |v_#memory_int_875| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_875| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:29:49,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:49,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,520 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_876|]. (let ((.cse0 (select |v_#memory_int_876| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_876| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:29:49,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:49,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_877|]. (let ((.cse0 (select |v_#memory_int_877| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_877| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:29:49,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:49,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_878|]. (let ((.cse0 (select |v_#memory_int_878| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_878| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:29:49,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:49,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_879|]. (let ((.cse0 (select |v_#memory_int_879| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_879| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:49,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:49,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_880|]. (let ((.cse0 (select |v_#memory_int_880| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_880| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:29:49,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:49,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_881|]. (let ((.cse0 (select |v_#memory_int_881| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_881| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:29:49,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:49,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,688 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,688 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_882|]. (let ((.cse0 (select |v_#memory_int_882| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:49,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:49,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_883|]. (let ((.cse0 (select |v_#memory_int_883| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_883| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:49,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:49,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_884|]. (let ((.cse0 (select |v_#memory_int_884| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:29:49,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:49,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_885|]. (let ((.cse0 (select |v_#memory_int_885| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:29:49,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:49,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_886|]. (let ((.cse0 (select |v_#memory_int_886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:29:49,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:49,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_887|]. (let ((.cse0 (select |v_#memory_int_887| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:49,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:49,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_888|]. (let ((.cse0 (select |v_#memory_int_888| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_888| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:49,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:49,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_889|]. (let ((.cse0 (select |v_#memory_int_889| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:29:49,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:49,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:49,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:49,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:49,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:49,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:49,971 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_890|]. (let ((.cse0 (select |v_#memory_int_890| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_890| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:49,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:50,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_891|]. (let ((.cse0 (select |v_#memory_int_891| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_891| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 22))) [2019-05-15 10:29:50,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:50,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_892|]. (let ((.cse0 (select |v_#memory_int_892| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_892| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:29:50,055 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:50,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,107 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_893|]. (let ((.cse0 (select |v_#memory_int_893| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_893| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:29:50,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:50,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_894|]. (let ((.cse0 (select |v_#memory_int_894| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_894| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:50,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,187 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_895|]. (let ((.cse0 (select |v_#memory_int_895| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_895| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:29:50,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:50,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_896|]. (let ((.cse0 (select |v_#memory_int_896| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_896| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:29:50,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:50,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_897|]. (let ((.cse0 (select |v_#memory_int_897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:29:50,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:50,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_898|]. (let ((.cse0 (select |v_#memory_int_898| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_898| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:29:50,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:50,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,355 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_899|]. (let ((.cse0 (select |v_#memory_int_899| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_899| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:50,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_900|]. (let ((.cse0 (select |v_#memory_int_900| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_900| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:50,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_901|]. (let ((.cse0 (select |v_#memory_int_901| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:29:50,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:50,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_902|]. (let ((.cse0 (select |v_#memory_int_902| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:50,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_903|]. (let ((.cse0 (select |v_#memory_int_903| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_903| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 34 .cse0))) [2019-05-15 10:29:50,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:50,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_904|]. (let ((.cse0 (select |v_#memory_int_904| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:50,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_905|]. (let ((.cse0 (select |v_#memory_int_905| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_905| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:50,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_906|]. (let ((.cse0 (select |v_#memory_int_906| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_906| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:50,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:50,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_907|]. (let ((.cse0 (select |v_#memory_int_907| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:50,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_908|]. (let ((.cse0 (select |v_#memory_int_908| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:29:50,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:50,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:50,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:50,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:50,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:50,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_909|]. (let ((.cse0 (select |v_#memory_int_909| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:50,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:29:50,915 INFO L273 TraceCheckUtils]: 0: Hoare triple {8132#true} havoc main_p1; {8132#true} is VALID [2019-05-15 10:29:50,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {8132#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8132#true} is VALID [2019-05-15 10:29:50,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {8132#true} #memory_int := #memory_int[main_p1 := 0]; {8143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:50,917 INFO L273 TraceCheckUtils]: 3: Hoare triple {8143#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:50,917 INFO L273 TraceCheckUtils]: 4: Hoare triple {8147#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:50,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {8151#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:50,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {8155#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:50,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {8159#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:50,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {8163#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:50,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {8167#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:50,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {8171#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:50,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {8175#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:50,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {8179#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:50,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {8183#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:50,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {8187#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:50,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {8191#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:50,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {8195#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8199#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:50,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {8199#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8203#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:50,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {8203#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8207#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:50,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {8207#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8211#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:50,930 INFO L273 TraceCheckUtils]: 20: Hoare triple {8211#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8215#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:50,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {8215#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8219#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:50,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {8219#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8223#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:50,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {8223#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8227#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:50,933 INFO L273 TraceCheckUtils]: 24: Hoare triple {8227#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8231#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:50,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {8231#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8235#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:50,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {8235#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8239#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:50,935 INFO L273 TraceCheckUtils]: 27: Hoare triple {8239#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8243#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:50,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {8243#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8247#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:50,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {8247#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8251#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:50,937 INFO L273 TraceCheckUtils]: 30: Hoare triple {8251#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8255#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:50,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {8255#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8259#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:50,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {8259#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8263#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:50,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {8263#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8267#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:50,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {8267#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8271#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:50,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {8271#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8275#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:50,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {8275#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8279#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:50,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {8279#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8283#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:50,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {8283#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8287#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:50,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {8287#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8291#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:50,945 INFO L273 TraceCheckUtils]: 40: Hoare triple {8291#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8295#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:50,946 INFO L273 TraceCheckUtils]: 41: Hoare triple {8295#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8299#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:50,946 INFO L273 TraceCheckUtils]: 42: Hoare triple {8299#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8303#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:29:50,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {8303#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8307#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:29:50,948 INFO L273 TraceCheckUtils]: 44: Hoare triple {8307#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} assume !(#memory_int[main_p1] >= 0); {8133#false} is VALID [2019-05-15 10:29:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:50,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:50,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-15 10:29:50,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-05-15 10:29:50,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:50,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2019-05-15 10:29:50,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:50,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-05-15 10:29:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-15 10:29:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:29:50,989 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 44 states. [2019-05-15 10:29:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:54,787 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:54,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-15 10:29:54,787 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2019-05-15 10:29:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:29:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:29:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-05-15 10:29:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-05-15 10:29:54,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2019-05-15 10:29:54,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:54,827 INFO L225 Difference]: With dead ends: 47 [2019-05-15 10:29:54,827 INFO L226 Difference]: Without dead ends: 47 [2019-05-15 10:29:54,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-05-15 10:29:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-05-15 10:29:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-05-15 10:29:54,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:29:54,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:54,830 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:54,830 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:54,831 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:54,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:54,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:54,831 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:54,831 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-05-15 10:29:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:29:54,832 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-05-15 10:29:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:54,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:29:54,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:29:54,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:29:54,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:29:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:29:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-05-15 10:29:54,833 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-05-15 10:29:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:29:54,834 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-05-15 10:29:54,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-05-15 10:29:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-05-15 10:29:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-05-15 10:29:54,834 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:54,834 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-05-15 10:29:54,835 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -266140728, now seen corresponding path program 42 times [2019-05-15 10:29:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:54,848 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-15 10:29:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:54,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:54,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:54,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:54,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:54,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:54,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:29:54,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:54,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_910|]. (= (store |v_#memory_int_910| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:29:54,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:29:54,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:54,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_911|]. (let ((.cse0 (select |v_#memory_int_911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:29:55,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:29:55,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,055 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_912|]. (let ((.cse0 (select |v_#memory_int_912| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:29:55,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_913|]. (let ((.cse0 (select |v_#memory_int_913| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_913| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:29:55,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:29:55,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_914|]. (let ((.cse0 (select |v_#memory_int_914| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:29:55,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:29:55,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_915|]. (let ((.cse0 (select |v_#memory_int_915| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_915| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:29:55,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:29:55,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_916|]. (let ((.cse0 (select |v_#memory_int_916| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:29:55,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_917|]. (let ((.cse0 (select |v_#memory_int_917| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:29:55,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:29:55,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_918|]. (let ((.cse0 (select |v_#memory_int_918| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_918| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:29:55,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_919|]. (let ((.cse0 (select |v_#memory_int_919| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_919| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:29:55,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:29:55,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_920|]. (let ((.cse0 (select |v_#memory_int_920| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_920| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:29:55,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:29:55,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_921|]. (let ((.cse0 (select |v_#memory_int_921| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_921| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:29:55,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:29:55,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_922|]. (let ((.cse0 (select |v_#memory_int_922| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_922| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:29:55,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_923|]. (let ((.cse0 (select |v_#memory_int_923| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_923| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:29:55,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_924|]. (let ((.cse0 (select |v_#memory_int_924| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:29:55,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_925|]. (let ((.cse0 (select |v_#memory_int_925| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:29:55,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,421 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_926|]. (let ((.cse0 (select |v_#memory_int_926| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_926| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:29:55,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_927|]. (let ((.cse0 (select |v_#memory_int_927| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_927| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:29:55,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_928|]. (let ((.cse0 (select |v_#memory_int_928| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:29:55,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_929|]. (let ((.cse0 (select |v_#memory_int_929| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_929| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:29:55,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_930|]. (let ((.cse0 (select |v_#memory_int_930| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_930| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:29:55,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:29:55,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_931|]. (let ((.cse0 (select |v_#memory_int_931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:29:55,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:29:55,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_932|]. (let ((.cse0 (select |v_#memory_int_932| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_932| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:29:55,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_933|]. (let ((.cse0 (select |v_#memory_int_933| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_933| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:55,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:29:55,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_934|]. (let ((.cse0 (select |v_#memory_int_934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:29:55,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:29:55,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_935|]. (let ((.cse0 (select |v_#memory_int_935| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:29:55,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:29:55,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_936|]. (let ((.cse0 (select |v_#memory_int_936| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_936| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:29:55,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_937|]. (let ((.cse0 (select |v_#memory_int_937| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_937| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:55,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:29:55,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_938|]. (let ((.cse0 (select |v_#memory_int_938| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_938| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:29:55,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:29:55,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:55,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:55,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:55,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:55,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:55,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_939|]. (let ((.cse0 (select |v_#memory_int_939| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_939| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:29:55,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:29:56,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_940|]. (let ((.cse0 (select |v_#memory_int_940| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_940| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:29:56,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:29:56,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_941|]. (let ((.cse0 (select |v_#memory_int_941| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:29:56,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_942|]. (let ((.cse0 (select |v_#memory_int_942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:29:56,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:29:56,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_943|]. (let ((.cse0 (select |v_#memory_int_943| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_943| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:29:56,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:29:56,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_944|]. (let ((.cse0 (select |v_#memory_int_944| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_944| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:29:56,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:29:56,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_945|]. (let ((.cse0 (select |v_#memory_int_945| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:29:56,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_946|]. (let ((.cse0 (select |v_#memory_int_946| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_946| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:29:56,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_947|]. (let ((.cse0 (select |v_#memory_int_947| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_947| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:29:56,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_948|]. (let ((.cse0 (select |v_#memory_int_948| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_948| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:29:56,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:29:56,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_949|]. (let ((.cse0 (select |v_#memory_int_949| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_949| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:29:56,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:29:56,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_950|]. (let ((.cse0 (select |v_#memory_int_950| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_950| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:29:56,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:29:56,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_951|]. (let ((.cse0 (select |v_#memory_int_951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:29:56,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:29:56,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:29:56,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:56,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:56,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:29:56,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:56,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_952|]. (let ((.cse0 (select |v_#memory_int_952| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_952| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:29:56,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:29:56,636 INFO L273 TraceCheckUtils]: 0: Hoare triple {8498#true} havoc main_p1; {8498#true} is VALID [2019-05-15 10:29:56,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {8498#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8498#true} is VALID [2019-05-15 10:29:56,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {8498#true} #memory_int := #memory_int[main_p1 := 0]; {8509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:29:56,638 INFO L273 TraceCheckUtils]: 3: Hoare triple {8509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:29:56,639 INFO L273 TraceCheckUtils]: 4: Hoare triple {8513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:29:56,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {8517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:29:56,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {8521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:29:56,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {8525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:29:56,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {8529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:29:56,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {8533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:29:56,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {8537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:29:56,644 INFO L273 TraceCheckUtils]: 11: Hoare triple {8541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:29:56,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {8545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:29:56,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {8549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:29:56,646 INFO L273 TraceCheckUtils]: 14: Hoare triple {8553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:29:56,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {8557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:29:56,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {8561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:29:56,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {8565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:29:56,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {8569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:29:56,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {8573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:29:56,651 INFO L273 TraceCheckUtils]: 20: Hoare triple {8577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:29:56,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {8581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:29:56,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {8585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:29:56,653 INFO L273 TraceCheckUtils]: 23: Hoare triple {8589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:29:56,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {8593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:29:56,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {8597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:29:56,655 INFO L273 TraceCheckUtils]: 26: Hoare triple {8601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:29:56,656 INFO L273 TraceCheckUtils]: 27: Hoare triple {8605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:29:56,657 INFO L273 TraceCheckUtils]: 28: Hoare triple {8609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:29:56,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {8613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:29:56,658 INFO L273 TraceCheckUtils]: 30: Hoare triple {8617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:29:56,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {8621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:29:56,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {8625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:29:56,661 INFO L273 TraceCheckUtils]: 33: Hoare triple {8629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:29:56,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {8633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:29:56,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {8637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:29:56,663 INFO L273 TraceCheckUtils]: 36: Hoare triple {8641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:29:56,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {8645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:29:56,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {8649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:29:56,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {8653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:29:56,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {8657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:29:56,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {8661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:29:56,668 INFO L273 TraceCheckUtils]: 42: Hoare triple {8665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:29:56,668 INFO L273 TraceCheckUtils]: 43: Hoare triple {8669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:29:56,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {8673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:29:56,670 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} assume !(#memory_int[main_p1] >= 0); {8499#false} is VALID [2019-05-15 10:29:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:56,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:29:56,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-15 10:29:56,675 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-05-15 10:29:56,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:56,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2019-05-15 10:29:56,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:56,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-05-15 10:29:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-15 10:29:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-05-15 10:29:56,713 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 45 states. [2019-05-15 10:30:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:00,806 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-15 10:30:00,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 46 [2019-05-15 10:30:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:30:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-05-15 10:30:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-05-15 10:30:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-05-15 10:30:00,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2019-05-15 10:30:00,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:00,854 INFO L225 Difference]: With dead ends: 48 [2019-05-15 10:30:00,854 INFO L226 Difference]: Without dead ends: 48 [2019-05-15 10:30:00,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-05-15 10:30:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-05-15 10:30:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-05-15 10:30:00,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:00,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:00,858 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:00,858 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:00,859 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:00,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:00,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:00,860 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:00,860 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2019-05-15 10:30:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:00,860 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-05-15 10:30:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:00,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:00,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:00,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:00,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-05-15 10:30:00,862 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-05-15 10:30:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:00,862 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-05-15 10:30:00,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-05-15 10:30:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-05-15 10:30:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-05-15 10:30:00,863 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:00,863 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-05-15 10:30:00,863 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 339571970, now seen corresponding path program 43 times [2019-05-15 10:30:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:00,877 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-15 10:30:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:00,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:00,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:00,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:00,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:00,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:00,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_953|]. (= |#memory_int| (store |v_#memory_int_953| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:00,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:00,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:00,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:00,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:00,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:00,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_954|]. (let ((.cse0 (select |v_#memory_int_954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:30:00,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:00,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:00,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:00,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:00,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,005 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_955|]. (let ((.cse0 (select |v_#memory_int_955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:30:01,005 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:01,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_956|]. (let ((.cse0 (select |v_#memory_int_956| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_956| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:01,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:01,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_957|]. (let ((.cse0 (select |v_#memory_int_957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:01,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:01,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_958|]. (let ((.cse0 (select |v_#memory_int_958| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:01,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:01,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_959|]. (let ((.cse0 (select |v_#memory_int_959| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_959| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:30:01,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:01,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_960|]. (let ((.cse0 (select |v_#memory_int_960| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_960| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:01,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_961|]. (let ((.cse0 (select |v_#memory_int_961| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:01,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:01,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_962|]. (let ((.cse0 (select |v_#memory_int_962| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:01,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:01,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_963|]. (let ((.cse0 (select |v_#memory_int_963| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_963| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:01,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:01,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_964|]. (let ((.cse0 (select |v_#memory_int_964| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_964| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:30:01,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:01,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_965|]. (let ((.cse0 (select |v_#memory_int_965| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_965| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:30:01,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:01,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_966|]. (let ((.cse0 (select |v_#memory_int_966| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_966| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:01,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_967|]. (let ((.cse0 (select |v_#memory_int_967| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:30:01,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:01,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_968|]. (let ((.cse0 (select |v_#memory_int_968| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_968| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:30:01,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:01,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_969|]. (let ((.cse0 (select |v_#memory_int_969| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_969| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:30:01,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:01,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,437 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_970|]. (let ((.cse0 (select |v_#memory_int_970| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:01,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:01,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_971|]. (let ((.cse0 (select |v_#memory_int_971| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:01,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:01,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_972|]. (let ((.cse0 (select |v_#memory_int_972| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_972| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:30:01,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:01,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_973|]. (let ((.cse0 (select |v_#memory_int_973| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_973| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:01,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_974|]. (let ((.cse0 (select |v_#memory_int_974| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_974| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:01,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_975|]. (let ((.cse0 (select |v_#memory_int_975| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_975| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:01,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:01,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_976|]. (let ((.cse0 (select |v_#memory_int_976| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_976| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:01,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,689 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,689 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_977|]. (let ((.cse0 (select |v_#memory_int_977| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_977| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,689 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:01,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_978|]. (let ((.cse0 (select |v_#memory_int_978| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_978| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:01,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:01,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_979|]. (let ((.cse0 (select |v_#memory_int_979| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_979| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 25))) [2019-05-15 10:30:01,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:01,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_980|]. (let ((.cse0 (select |v_#memory_int_980| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_980| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:30:01,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:01,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_981|]. (let ((.cse0 (select |v_#memory_int_981| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:01,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:01,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_982|]. (let ((.cse0 (select |v_#memory_int_982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:30:01,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:01,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:01,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:01,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:01,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:01,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:01,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_983|]. (let ((.cse0 (select |v_#memory_int_983| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_983| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:01,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:02,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_984|]. (let ((.cse0 (select |v_#memory_int_984| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_984| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:02,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_985|]. (let ((.cse0 (select |v_#memory_int_985| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_985| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:02,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,129 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_986|]. (let ((.cse0 (select |v_#memory_int_986| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,129 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:02,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_987|]. (let ((.cse0 (select |v_#memory_int_987| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:30:02,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:02,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_988|]. (let ((.cse0 (select |v_#memory_int_988| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:02,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:02,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_989|]. (let ((.cse0 (select |v_#memory_int_989| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:02,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_990|]. (let ((.cse0 (select |v_#memory_int_990| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_990| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:02,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:02,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_991|]. (let ((.cse0 (select |v_#memory_int_991| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_991| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:30:02,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:02,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_992|]. (let ((.cse0 (select |v_#memory_int_992| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:02,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:02,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_993|]. (let ((.cse0 (select |v_#memory_int_993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:02,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:02,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:02,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:02,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:02,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:02,624 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:02,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_994|]. (let ((.cse0 (select |v_#memory_int_994| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_994| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:02,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:03,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_995|]. (let ((.cse0 (select |v_#memory_int_995| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:03,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:03,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:03,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:03,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:03,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:03,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:03,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_996|]. (let ((.cse0 (select |v_#memory_int_996| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:03,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:03,905 INFO L273 TraceCheckUtils]: 0: Hoare triple {8872#true} havoc main_p1; {8872#true} is VALID [2019-05-15 10:30:03,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {8872#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {8872#true} is VALID [2019-05-15 10:30:03,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {8872#true} #memory_int := #memory_int[main_p1 := 0]; {8883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:03,907 INFO L273 TraceCheckUtils]: 3: Hoare triple {8883#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:03,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {8887#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:03,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {8891#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:03,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {8895#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:03,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {8899#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:03,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {8903#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:03,910 INFO L273 TraceCheckUtils]: 9: Hoare triple {8907#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:03,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {8911#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:03,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {8915#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:03,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {8919#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:03,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {8923#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:03,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {8927#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8931#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:03,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {8931#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8935#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:03,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {8935#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8939#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:03,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {8939#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8943#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:03,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {8943#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8947#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:03,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {8947#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8951#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:03,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {8951#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8955#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:03,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {8955#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8959#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:03,921 INFO L273 TraceCheckUtils]: 22: Hoare triple {8959#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8963#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:03,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {8963#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8967#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:03,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {8967#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8971#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:03,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {8971#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8975#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:03,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {8975#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8979#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:03,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {8979#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8983#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:03,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {8983#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8987#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:03,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {8987#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8991#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:03,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {8991#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8995#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:03,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {8995#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {8999#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:03,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {8999#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9003#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:03,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {9003#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9007#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:03,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {9007#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9011#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:03,931 INFO L273 TraceCheckUtils]: 35: Hoare triple {9011#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9015#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:03,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {9015#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9019#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:03,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {9019#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9023#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:03,934 INFO L273 TraceCheckUtils]: 38: Hoare triple {9023#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9027#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:03,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {9027#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9031#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:03,935 INFO L273 TraceCheckUtils]: 40: Hoare triple {9031#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9035#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:03,936 INFO L273 TraceCheckUtils]: 41: Hoare triple {9035#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9039#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:03,937 INFO L273 TraceCheckUtils]: 42: Hoare triple {9039#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9043#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:03,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {9043#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9047#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:03,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {9047#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9051#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:03,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {9051#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9055#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:03,940 INFO L273 TraceCheckUtils]: 46: Hoare triple {9055#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} assume !(#memory_int[main_p1] >= 0); {8873#false} is VALID [2019-05-15 10:30:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:03,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:03,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-15 10:30:03,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-05-15 10:30:03,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:03,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2019-05-15 10:30:03,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:03,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-05-15 10:30:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-15 10:30:03,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:30:03,984 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 46 states. [2019-05-15 10:30:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,206 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-15 10:30:08,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-05-15 10:30:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:30:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:30:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-05-15 10:30:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-05-15 10:30:08,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2019-05-15 10:30:08,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:08,249 INFO L225 Difference]: With dead ends: 49 [2019-05-15 10:30:08,249 INFO L226 Difference]: Without dead ends: 49 [2019-05-15 10:30:08,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-05-15 10:30:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-05-15 10:30:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-05-15 10:30:08,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:08,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:08,251 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:08,251 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,252 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:08,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:08,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:08,253 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:08,253 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2019-05-15 10:30:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:08,254 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-05-15 10:30:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:08,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:08,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:08,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:08,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-05-15 10:30:08,255 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-05-15 10:30:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:08,255 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-05-15 10:30:08,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-05-15 10:30:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-05-15 10:30:08,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-05-15 10:30:08,255 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:08,255 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-05-15 10:30:08,256 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:08,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:08,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1936796424, now seen corresponding path program 44 times [2019-05-15 10:30:08,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:08,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-15 10:30:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:08,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:08,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:08,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:08,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_997|]. (= |#memory_int| (store |v_#memory_int_997| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:08,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:08,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_998|]. (let ((.cse0 (select |v_#memory_int_998| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_998| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:08,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:08,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_999|]. (let ((.cse0 (select |v_#memory_int_999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:30:08,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:08,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1000|]. (let ((.cse0 (select |v_#memory_int_1000| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:08,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1001|]. (let ((.cse0 (select |v_#memory_int_1001| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1001| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:08,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:08,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1002|]. (let ((.cse0 (select |v_#memory_int_1002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:30:08,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:08,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1003|]. (let ((.cse0 (select |v_#memory_int_1003| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1003| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:08,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1004|]. (let ((.cse0 (select |v_#memory_int_1004| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:30:08,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:08,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1005|]. (let ((.cse0 (select |v_#memory_int_1005| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1005| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:30:08,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:08,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,531 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1006|]. (let ((.cse0 (select |v_#memory_int_1006| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:08,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1007|]. (let ((.cse0 (select |v_#memory_int_1007| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1007| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:08,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:08,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1008|]. (let ((.cse0 (select |v_#memory_int_1008| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_1008| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:08,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:08,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1009|]. (let ((.cse0 (select |v_#memory_int_1009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:30:08,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:08,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1010|]. (let ((.cse0 (select |v_#memory_int_1010| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1010| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:08,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1011|]. (let ((.cse0 (select |v_#memory_int_1011| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:30:08,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:08,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,705 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1012|]. (let ((.cse0 (select |v_#memory_int_1012| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:08,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1013|]. (let ((.cse0 (select |v_#memory_int_1013| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1013| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:30:08,738 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:08,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1014|]. (let ((.cse0 (select |v_#memory_int_1014| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:30:08,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:08,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1015|]. (let ((.cse0 (select |v_#memory_int_1015| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1015| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:08,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:08,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1016|]. (let ((.cse0 (select |v_#memory_int_1016| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_1016| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:08,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:08,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1017|]. (let ((.cse0 (select |v_#memory_int_1017| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:08,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1018|]. (let ((.cse0 (select |v_#memory_int_1018| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_1018| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:08,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:08,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1019|]. (let ((.cse0 (select |v_#memory_int_1019| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:08,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:08,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:08,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:08,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:08,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:08,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:08,979 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1020|]. (let ((.cse0 (select |v_#memory_int_1020| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1020| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:08,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:09,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1021|]. (let ((.cse0 (select |v_#memory_int_1021| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:09,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1022|]. (let ((.cse0 (select |v_#memory_int_1022| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:09,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1023|]. (let ((.cse0 (select |v_#memory_int_1023| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1023| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:30:09,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:09,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1024|]. (let ((.cse0 (select |v_#memory_int_1024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:30:09,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:09,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1025|]. (let ((.cse0 (select |v_#memory_int_1025| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= |#memory_int| (store |v_#memory_int_1025| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:09,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1026|]. (let ((.cse0 (select |v_#memory_int_1026| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1026| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:09,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1027|]. (let ((.cse0 (select |v_#memory_int_1027| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1027| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:30:09,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:09,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1028|]. (let ((.cse0 (select |v_#memory_int_1028| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:30:09,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:09,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1029|]. (let ((.cse0 (select |v_#memory_int_1029| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_1029| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:09,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:09,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1030|]. (let ((.cse0 (select |v_#memory_int_1030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:30:09,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:09,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,769 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1031|]. (let ((.cse0 (select |v_#memory_int_1031| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:09,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1032|]. (let ((.cse0 (select |v_#memory_int_1032| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1032| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:30:09,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:09,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1033|]. (let ((.cse0 (select |v_#memory_int_1033| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:09,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:09,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,923 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1034|]. (let ((.cse0 (select |v_#memory_int_1034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:09,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:09,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:09,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:09,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:09,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:09,974 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:09,974 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1035|]. (let ((.cse0 (select |v_#memory_int_1035| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1035| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:30:09,974 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:10,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1036|]. (let ((.cse0 (select |v_#memory_int_1036| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_1036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:10,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:10,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1037|]. (let ((.cse0 (select |v_#memory_int_1037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:10,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:10,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1038|]. (let ((.cse0 (select |v_#memory_int_1038| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_1038| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:10,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:10,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1039|]. (let ((.cse0 (select |v_#memory_int_1039| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1039| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:30:10,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:10,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1040|]. (let ((.cse0 (select |v_#memory_int_1040| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1040| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 42 .cse0))) [2019-05-15 10:30:10,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:10,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:10,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:10,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:10,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:10,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:10,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1041|]. (let ((.cse0 (select |v_#memory_int_1041| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:10,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:10,353 INFO L273 TraceCheckUtils]: 0: Hoare triple {9254#true} havoc main_p1; {9254#true} is VALID [2019-05-15 10:30:10,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {9254#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {9254#true} is VALID [2019-05-15 10:30:10,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {9254#true} #memory_int := #memory_int[main_p1 := 0]; {9265#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:10,355 INFO L273 TraceCheckUtils]: 3: Hoare triple {9265#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9269#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:10,356 INFO L273 TraceCheckUtils]: 4: Hoare triple {9269#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9273#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:10,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {9273#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9277#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:10,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {9277#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9281#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:10,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {9281#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9285#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:10,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {9285#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9289#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:10,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {9289#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9293#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:10,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {9293#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9297#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:10,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {9297#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9301#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:10,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {9301#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9305#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:10,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {9305#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9309#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:10,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {9309#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9313#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:10,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {9313#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9317#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:10,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {9317#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9321#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:10,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {9321#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9325#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:10,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {9325#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9329#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:10,365 INFO L273 TraceCheckUtils]: 19: Hoare triple {9329#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9333#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:10,366 INFO L273 TraceCheckUtils]: 20: Hoare triple {9333#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9337#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:10,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {9337#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9341#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:10,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {9341#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9345#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:10,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {9345#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9349#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:10,369 INFO L273 TraceCheckUtils]: 24: Hoare triple {9349#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9353#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:10,370 INFO L273 TraceCheckUtils]: 25: Hoare triple {9353#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9357#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:10,371 INFO L273 TraceCheckUtils]: 26: Hoare triple {9357#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9361#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:10,371 INFO L273 TraceCheckUtils]: 27: Hoare triple {9361#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9365#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:10,372 INFO L273 TraceCheckUtils]: 28: Hoare triple {9365#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9369#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:10,373 INFO L273 TraceCheckUtils]: 29: Hoare triple {9369#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9373#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:10,374 INFO L273 TraceCheckUtils]: 30: Hoare triple {9373#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9377#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:10,374 INFO L273 TraceCheckUtils]: 31: Hoare triple {9377#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9381#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:10,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {9381#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9385#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:10,376 INFO L273 TraceCheckUtils]: 33: Hoare triple {9385#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9389#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:10,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {9389#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9393#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:10,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {9393#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9397#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:10,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {9397#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9401#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:10,379 INFO L273 TraceCheckUtils]: 37: Hoare triple {9401#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9405#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:10,380 INFO L273 TraceCheckUtils]: 38: Hoare triple {9405#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9409#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:10,381 INFO L273 TraceCheckUtils]: 39: Hoare triple {9409#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9413#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:10,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {9413#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9417#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:10,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {9417#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9421#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:10,383 INFO L273 TraceCheckUtils]: 42: Hoare triple {9421#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9425#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:10,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {9425#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9429#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:10,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {9429#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9433#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:10,385 INFO L273 TraceCheckUtils]: 45: Hoare triple {9433#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9437#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:10,386 INFO L273 TraceCheckUtils]: 46: Hoare triple {9437#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9441#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:10,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {9441#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} assume !(#memory_int[main_p1] >= 0); {9255#false} is VALID [2019-05-15 10:30:10,391 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:10,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:10,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-15 10:30:10,392 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-05-15 10:30:10,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:10,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2019-05-15 10:30:10,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:10,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-05-15 10:30:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-15 10:30:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-05-15 10:30:10,490 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 47 states. [2019-05-15 10:30:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:14,847 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-15 10:30:14,847 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 48 [2019-05-15 10:30:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:30:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-05-15 10:30:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-05-15 10:30:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-05-15 10:30:14,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2019-05-15 10:30:14,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:14,889 INFO L225 Difference]: With dead ends: 50 [2019-05-15 10:30:14,889 INFO L226 Difference]: Without dead ends: 50 [2019-05-15 10:30:14,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-05-15 10:30:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-05-15 10:30:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-05-15 10:30:14,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:14,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:14,890 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:14,890 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:14,891 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:14,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:14,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:14,891 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:14,891 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2019-05-15 10:30:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:14,892 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-05-15 10:30:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:14,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:14,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:14,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:14,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-05-15 10:30:14,893 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-05-15 10:30:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:14,893 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-05-15 10:30:14,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-05-15 10:30:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-05-15 10:30:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-05-15 10:30:14,894 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:14,894 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-05-15 10:30:14,894 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:14,894 INFO L82 PathProgramCache]: Analyzing trace with hash -88853054, now seen corresponding path program 45 times [2019-05-15 10:30:14,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:14,907 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-15 10:30:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:14,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:14,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:14,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:14,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:14,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:14,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:14,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1042|]. (= (store |v_#memory_int_1042| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:14,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:15,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1043|]. (let ((.cse0 (select |v_#memory_int_1043| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1043| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:30:15,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:15,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1044|]. (let ((.cse0 (select |v_#memory_int_1044| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1044| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 1))) [2019-05-15 10:30:15,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:15,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1045|]. (let ((.cse0 (select |v_#memory_int_1045| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1045| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:30:15,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:15,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1046|]. (let ((.cse0 (select |v_#memory_int_1046| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1046| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:30:15,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:15,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1047|]. (let ((.cse0 (select |v_#memory_int_1047| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:15,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:15,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1048|]. (let ((.cse0 (select |v_#memory_int_1048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:30:15,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:15,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1049|]. (let ((.cse0 (select |v_#memory_int_1049| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:15,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1050|]. (let ((.cse0 (select |v_#memory_int_1050| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_1050| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:15,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:15,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1051|]. (let ((.cse0 (select |v_#memory_int_1051| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:15,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1052|]. (let ((.cse0 (select |v_#memory_int_1052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:15,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:15,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1053|]. (let ((.cse0 (select |v_#memory_int_1053| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:15,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1054|]. (let ((.cse0 (select |v_#memory_int_1054| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1054| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:15,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1055|]. (let ((.cse0 (select |v_#memory_int_1055| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1055| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:15,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1056|]. (let ((.cse0 (select |v_#memory_int_1056| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:15,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1057|]. (let ((.cse0 (select |v_#memory_int_1057| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_1057| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:15,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:15,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1058|]. (let ((.cse0 (select |v_#memory_int_1058| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1058| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:30:15,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:15,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1059|]. (let ((.cse0 (select |v_#memory_int_1059| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:15,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,492 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1060|]. (let ((.cse0 (select |v_#memory_int_1060| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_1060| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:15,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:15,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1061|]. (let ((.cse0 (select |v_#memory_int_1061| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:15,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1062|]. (let ((.cse0 (select |v_#memory_int_1062| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1062| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:15,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:15,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1063|]. (let ((.cse0 (select |v_#memory_int_1063| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:15,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1064|]. (let ((.cse0 (select |v_#memory_int_1064| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1064| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:30:15,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:15,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1065|]. (let ((.cse0 (select |v_#memory_int_1065| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1065| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:30:15,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:15,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1066|]. (let ((.cse0 (select |v_#memory_int_1066| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:30:15,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:15,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,754 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1067|]. (let ((.cse0 (select |v_#memory_int_1067| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:15,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1068|]. (let ((.cse0 (select |v_#memory_int_1068| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:30:15,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:15,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1069|]. (let ((.cse0 (select |v_#memory_int_1069| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_1069| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:15,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:15,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1070|]. (let ((.cse0 (select |v_#memory_int_1070| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:30:15,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:15,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1071|]. (let ((.cse0 (select |v_#memory_int_1071| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1071| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:15,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:15,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:15,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:15,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:15,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:15,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:15,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1072|]. (let ((.cse0 (select |v_#memory_int_1072| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_1072| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:15,966 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:16,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1073|]. (let ((.cse0 (select |v_#memory_int_1073| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1073| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:16,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:16,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1074|]. (let ((.cse0 (select |v_#memory_int_1074| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:16,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,103 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,103 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1075|]. (let ((.cse0 (select |v_#memory_int_1075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:30:16,103 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:16,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1076|]. (let ((.cse0 (select |v_#memory_int_1076| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:16,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1077|]. (let ((.cse0 (select |v_#memory_int_1077| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:16,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1078|]. (let ((.cse0 (select |v_#memory_int_1078| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:30:16,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:16,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1079|]. (let ((.cse0 (select |v_#memory_int_1079| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_1079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:16,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1080|]. (let ((.cse0 (select |v_#memory_int_1080| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:16,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1081|]. (let ((.cse0 (select |v_#memory_int_1081| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1081| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:16,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,547 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1082|]. (let ((.cse0 (select |v_#memory_int_1082| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,547 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:16,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1083|]. (let ((.cse0 (select |v_#memory_int_1083| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1083| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:30:16,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:16,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1084|]. (let ((.cse0 (select |v_#memory_int_1084| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_1084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:16,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1085|]. (let ((.cse0 (select |v_#memory_int_1085| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_1085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:16,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:16,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1086|]. (let ((.cse0 (select |v_#memory_int_1086| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:16,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:16,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:16,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:16,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:16,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:16,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:16,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1087|]. (let ((.cse0 (select |v_#memory_int_1087| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1087| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:30:16,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:16,896 INFO L273 TraceCheckUtils]: 0: Hoare triple {9644#true} havoc main_p1; {9644#true} is VALID [2019-05-15 10:30:16,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {9644#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {9644#true} is VALID [2019-05-15 10:30:16,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {9644#true} #memory_int := #memory_int[main_p1 := 0]; {9655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:16,897 INFO L273 TraceCheckUtils]: 3: Hoare triple {9655#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:16,898 INFO L273 TraceCheckUtils]: 4: Hoare triple {9659#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:16,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {9663#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:16,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {9667#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:16,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {9671#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:16,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {9675#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:16,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {9679#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:16,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {9683#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:16,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {9687#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:16,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {9691#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9695#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:16,905 INFO L273 TraceCheckUtils]: 13: Hoare triple {9695#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9699#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:16,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {9699#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9703#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:16,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {9703#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9707#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:16,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {9707#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9711#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:16,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {9711#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9715#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:16,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {9715#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9719#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:16,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {9719#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9723#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:16,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {9723#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9727#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:16,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {9727#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9731#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:16,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {9731#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9735#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:16,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {9735#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9739#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:16,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {9739#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9743#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:16,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {9743#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9747#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:16,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {9747#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9751#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:16,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {9751#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9755#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:16,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {9755#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9759#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:16,917 INFO L273 TraceCheckUtils]: 29: Hoare triple {9759#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9763#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:16,918 INFO L273 TraceCheckUtils]: 30: Hoare triple {9763#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9767#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:16,919 INFO L273 TraceCheckUtils]: 31: Hoare triple {9767#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9771#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:16,919 INFO L273 TraceCheckUtils]: 32: Hoare triple {9771#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9775#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:16,920 INFO L273 TraceCheckUtils]: 33: Hoare triple {9775#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9779#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:16,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {9779#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9783#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:16,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {9783#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9787#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:16,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {9787#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9791#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:16,923 INFO L273 TraceCheckUtils]: 37: Hoare triple {9791#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9795#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:16,924 INFO L273 TraceCheckUtils]: 38: Hoare triple {9795#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9799#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:16,925 INFO L273 TraceCheckUtils]: 39: Hoare triple {9799#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9803#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:16,925 INFO L273 TraceCheckUtils]: 40: Hoare triple {9803#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9807#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:16,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {9807#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9811#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:16,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {9811#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9815#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:16,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {9815#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9819#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:16,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {9819#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9823#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:16,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {9823#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9827#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:16,930 INFO L273 TraceCheckUtils]: 46: Hoare triple {9827#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9831#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:16,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {9831#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {9835#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:16,931 INFO L273 TraceCheckUtils]: 48: Hoare triple {9835#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} assume !(#memory_int[main_p1] >= 0); {9645#false} is VALID [2019-05-15 10:30:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:16,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:16,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-15 10:30:16,937 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-05-15 10:30:16,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:16,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2019-05-15 10:30:16,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:16,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-05-15 10:30:16,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-15 10:30:16,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:16,977 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 48 states. [2019-05-15 10:30:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:21,517 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:21,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-15 10:30:21,517 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 49 [2019-05-15 10:30:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-05-15 10:30:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-05-15 10:30:21,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2019-05-15 10:30:21,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:21,559 INFO L225 Difference]: With dead ends: 51 [2019-05-15 10:30:21,559 INFO L226 Difference]: Without dead ends: 51 [2019-05-15 10:30:21,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-05-15 10:30:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-05-15 10:30:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-05-15 10:30:21,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:21,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:21,561 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:21,561 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:21,562 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:21,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:21,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:21,562 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:21,563 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2019-05-15 10:30:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:21,563 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-05-15 10:30:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:21,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:21,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:21,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:21,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-05-15 10:30:21,565 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-05-15 10:30:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:21,565 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-05-15 10:30:21,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-05-15 10:30:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-05-15 10:30:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-05-15 10:30:21,565 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:21,566 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-05-15 10:30:21,566 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:21,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1540522568, now seen corresponding path program 46 times [2019-05-15 10:30:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:21,581 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-15 10:30:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:21,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:21,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:21,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:21,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1088|]. (= (store |v_#memory_int_1088| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:21,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:21,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1089|]. (let ((.cse0 (select |v_#memory_int_1089| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:21,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:21,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1090|]. (let ((.cse0 (select |v_#memory_int_1090| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:30:21,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:21,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1091|]. (let ((.cse0 (select |v_#memory_int_1091| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:21,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:21,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1092|]. (let ((.cse0 (select |v_#memory_int_1092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:21,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:21,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1093|]. (let ((.cse0 (select |v_#memory_int_1093| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:30:21,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:21,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,832 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1094|]. (let ((.cse0 (select |v_#memory_int_1094| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:21,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:21,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1095|]. (let ((.cse0 (select |v_#memory_int_1095| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:21,866 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:21,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1096|]. (let ((.cse0 (select |v_#memory_int_1096| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_1096| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:21,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:21,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1097|]. (let ((.cse0 (select |v_#memory_int_1097| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1097| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:21,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:21,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1098|]. (let ((.cse0 (select |v_#memory_int_1098| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:21,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:21,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:21,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1099|]. (let ((.cse0 (select |v_#memory_int_1099| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:21,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:21,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:21,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:21,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:21,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:21,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1100|]. (let ((.cse0 (select |v_#memory_int_1100| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1100| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 11 .cse0))) [2019-05-15 10:30:22,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:22,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1101|]. (let ((.cse0 (select |v_#memory_int_1101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:30:22,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:22,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1102|]. (let ((.cse0 (select |v_#memory_int_1102| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:22,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1103|]. (let ((.cse0 (select |v_#memory_int_1103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:30:22,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:22,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,116 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1104|]. (let ((.cse0 (select |v_#memory_int_1104| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:30:22,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:22,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1105|]. (let ((.cse0 (select |v_#memory_int_1105| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1105| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:30:22,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:22,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1106|]. (let ((.cse0 (select |v_#memory_int_1106| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1106| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:30:22,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:22,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1107|]. (let ((.cse0 (select |v_#memory_int_1107| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1107| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:22,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1108|]. (let ((.cse0 (select |v_#memory_int_1108| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1108| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:30:22,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:22,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1109|]. (let ((.cse0 (select |v_#memory_int_1109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:30:22,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:22,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,409 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,409 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1110|]. (let ((.cse0 (select |v_#memory_int_1110| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,409 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:22,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1111|]. (let ((.cse0 (select |v_#memory_int_1111| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:22,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1112|]. (let ((.cse0 (select |v_#memory_int_1112| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1112| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:30:22,486 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:22,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1113|]. (let ((.cse0 (select |v_#memory_int_1113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:30:22,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:22,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1114|]. (let ((.cse0 (select |v_#memory_int_1114| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1114| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:22,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:22,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1115|]. (let ((.cse0 (select |v_#memory_int_1115| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:30:22,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:22,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1116|]. (let ((.cse0 (select |v_#memory_int_1116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:30:22,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:22,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1117|]. (let ((.cse0 (select |v_#memory_int_1117| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:22,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:22,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1118|]. (let ((.cse0 (select |v_#memory_int_1118| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1118| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:22,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:22,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:22,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:22,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:22,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:22,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1119|]. (let ((.cse0 (select |v_#memory_int_1119| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:22,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:23,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1120|]. (let ((.cse0 (select |v_#memory_int_1120| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:30:23,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:23,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1121|]. (let ((.cse0 (select |v_#memory_int_1121| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:23,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1122|]. (let ((.cse0 (select |v_#memory_int_1122| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1122| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:23,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:23,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1123|]. (let ((.cse0 (select |v_#memory_int_1123| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1123| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:30:23,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:23,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1124|]. (let ((.cse0 (select |v_#memory_int_1124| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_1124| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:23,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:23,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1125|]. (let ((.cse0 (select |v_#memory_int_1125| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_1125| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:23,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1126|]. (let ((.cse0 (select |v_#memory_int_1126| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1126| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:30:23,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:23,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1127|]. (let ((.cse0 (select |v_#memory_int_1127| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_1127| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:23,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1128|]. (let ((.cse0 (select |v_#memory_int_1128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:30:23,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:23,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1129|]. (let ((.cse0 (select |v_#memory_int_1129| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:23,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:23,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1130|]. (let ((.cse0 (select |v_#memory_int_1130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:30:23,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:23,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1131|]. (let ((.cse0 (select |v_#memory_int_1131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:30:23,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:23,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1132|]. (let ((.cse0 (select |v_#memory_int_1132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:23,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:23,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1133|]. (let ((.cse0 (select |v_#memory_int_1133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:30:23,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:23,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:23,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:23,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:23,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:23,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:23,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1134|]. (let ((.cse0 (select |v_#memory_int_1134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:30:23,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:23,857 INFO L273 TraceCheckUtils]: 0: Hoare triple {10042#true} havoc main_p1; {10042#true} is VALID [2019-05-15 10:30:23,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {10042#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10042#true} is VALID [2019-05-15 10:30:23,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {10042#true} #memory_int := #memory_int[main_p1 := 0]; {10053#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:23,859 INFO L273 TraceCheckUtils]: 3: Hoare triple {10053#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10057#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:23,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {10057#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10061#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:23,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {10061#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10065#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:23,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {10065#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10069#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:23,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {10069#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10073#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:23,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {10073#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10077#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:23,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {10077#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10081#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:23,863 INFO L273 TraceCheckUtils]: 10: Hoare triple {10081#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10085#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:23,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {10085#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10089#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:23,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {10089#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10093#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:23,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {10093#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10097#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:23,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {10097#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10101#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:23,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {10101#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10105#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:23,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {10105#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10109#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:23,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {10109#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10113#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:23,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {10113#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10117#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:23,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {10117#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10121#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:23,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {10121#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10125#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:23,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {10125#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10129#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:23,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {10129#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10133#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:23,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {10133#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10137#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:23,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {10137#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10141#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:23,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {10141#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10145#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:23,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {10145#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10149#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:23,876 INFO L273 TraceCheckUtils]: 27: Hoare triple {10149#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10153#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:23,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {10153#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10157#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:23,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {10157#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10161#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:23,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {10161#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10165#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:23,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {10165#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10169#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:23,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {10169#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10173#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:23,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {10173#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10177#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:23,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {10177#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10181#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:23,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {10181#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10185#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:23,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {10185#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10189#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:23,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {10189#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10193#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:23,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {10193#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10197#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:23,885 INFO L273 TraceCheckUtils]: 39: Hoare triple {10197#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10201#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:23,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {10201#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10205#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:23,886 INFO L273 TraceCheckUtils]: 41: Hoare triple {10205#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10209#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:23,887 INFO L273 TraceCheckUtils]: 42: Hoare triple {10209#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10213#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:23,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {10213#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10217#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:23,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {10217#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10221#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:23,889 INFO L273 TraceCheckUtils]: 45: Hoare triple {10221#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10225#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:23,890 INFO L273 TraceCheckUtils]: 46: Hoare triple {10225#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10229#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:23,891 INFO L273 TraceCheckUtils]: 47: Hoare triple {10229#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10233#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:23,891 INFO L273 TraceCheckUtils]: 48: Hoare triple {10233#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10237#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:23,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {10237#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} assume !(#memory_int[main_p1] >= 0); {10043#false} is VALID [2019-05-15 10:30:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:23,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:23,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-15 10:30:23,897 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-05-15 10:30:23,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:23,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2019-05-15 10:30:23,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:23,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-05-15 10:30:23,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-15 10:30:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-05-15 10:30:23,936 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 49 states. [2019-05-15 10:30:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:28,692 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-15 10:30:28,692 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 50 [2019-05-15 10:30:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-05-15 10:30:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-05-15 10:30:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-05-15 10:30:28,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 53 transitions. [2019-05-15 10:30:28,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:28,737 INFO L225 Difference]: With dead ends: 52 [2019-05-15 10:30:28,737 INFO L226 Difference]: Without dead ends: 52 [2019-05-15 10:30:28,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-05-15 10:30:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-05-15 10:30:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-05-15 10:30:28,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:28,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:28,739 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:28,739 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:28,740 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:28,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:28,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:28,740 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:28,740 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2019-05-15 10:30:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:28,741 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-05-15 10:30:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:28,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:28,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:28,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-05-15 10:30:28,742 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-05-15 10:30:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:28,742 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-05-15 10:30:28,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-05-15 10:30:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-05-15 10:30:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-05-15 10:30:28,742 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:28,743 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-05-15 10:30:28,743 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 511559298, now seen corresponding path program 47 times [2019-05-15 10:30:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:28,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-15 10:30:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:28,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:28,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:28,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:28,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1135|]. (= |#memory_int| (store |v_#memory_int_1135| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:28,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:28,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1136|]. (let ((.cse0 (select |v_#memory_int_1136| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:28,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:28,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1137|]. (let ((.cse0 (select |v_#memory_int_1137| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_1137| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:28,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:28,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1138|]. (let ((.cse0 (select |v_#memory_int_1138| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:28,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:28,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1139|]. (let ((.cse0 (select |v_#memory_int_1139| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_1139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:28,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:28,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1140|]. (let ((.cse0 (select |v_#memory_int_1140| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:28,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:28,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,922 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1141|]. (let ((.cse0 (select |v_#memory_int_1141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:30:28,922 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:28,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1142|]. (let ((.cse0 (select |v_#memory_int_1142| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1142| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:28,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:28,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,972 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1143|]. (let ((.cse0 (select |v_#memory_int_1143| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:28,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:28,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:28,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:28,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:28,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:28,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:28,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1144|]. (let ((.cse0 (select |v_#memory_int_1144| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:28,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:29,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1145|]. (let ((.cse0 (select |v_#memory_int_1145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:30:29,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:29,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1146|]. (let ((.cse0 (select |v_#memory_int_1146| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:30:29,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:29,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1147|]. (let ((.cse0 (select |v_#memory_int_1147| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:29,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1148|]. (let ((.cse0 (select |v_#memory_int_1148| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:29,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1149|]. (let ((.cse0 (select |v_#memory_int_1149| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_1149| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:29,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:29,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1150|]. (let ((.cse0 (select |v_#memory_int_1150| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:30:29,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:29,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1151|]. (let ((.cse0 (select |v_#memory_int_1151| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_1151| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:29,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:29,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1152|]. (let ((.cse0 (select |v_#memory_int_1152| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:30:29,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:29,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1153|]. (let ((.cse0 (select |v_#memory_int_1153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:29,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:29,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1154|]. (let ((.cse0 (select |v_#memory_int_1154| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:29,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1155|]. (let ((.cse0 (select |v_#memory_int_1155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:29,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:29,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1156|]. (let ((.cse0 (select |v_#memory_int_1156| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_1156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:29,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:29,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1157|]. (let ((.cse0 (select |v_#memory_int_1157| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:29,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1158|]. (let ((.cse0 (select |v_#memory_int_1158| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:30:29,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:29,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1159|]. (let ((.cse0 (select |v_#memory_int_1159| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_1159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:29,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:29,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1160|]. (let ((.cse0 (select |v_#memory_int_1160| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1160| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:29,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:29,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1161|]. (let ((.cse0 (select |v_#memory_int_1161| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:29,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1162|]. (let ((.cse0 (select |v_#memory_int_1162| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:29,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1163|]. (let ((.cse0 (select |v_#memory_int_1163| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:29,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:29,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1164|]. (let ((.cse0 (select |v_#memory_int_1164| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:29,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:29,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:29,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:29,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1165|]. (let ((.cse0 (select |v_#memory_int_1165| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1165| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:30:29,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:29,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:29,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:29,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:29,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1166|]. (let ((.cse0 (select |v_#memory_int_1166| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1166| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:30:30,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:30,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1167|]. (let ((.cse0 (select |v_#memory_int_1167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:30:30,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:30,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1168|]. (let ((.cse0 (select |v_#memory_int_1168| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:30,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1169|]. (let ((.cse0 (select |v_#memory_int_1169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:30:30,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:30,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1170|]. (let ((.cse0 (select |v_#memory_int_1170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:30:30,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:30,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1171|]. (let ((.cse0 (select |v_#memory_int_1171| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,313 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:30,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,365 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1172|]. (let ((.cse0 (select |v_#memory_int_1172| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1172| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:30:30,365 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:30,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1173|]. (let ((.cse0 (select |v_#memory_int_1173| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:30,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1174|]. (let ((.cse0 (select |v_#memory_int_1174| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:30,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:30,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1175|]. (let ((.cse0 (select |v_#memory_int_1175| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_1175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:30,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:30,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1176|]. (let ((.cse0 (select |v_#memory_int_1176| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1176| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:30:30,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:30,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1177|]. (let ((.cse0 (select |v_#memory_int_1177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:30:30,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:30,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,705 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1178|]. (let ((.cse0 (select |v_#memory_int_1178| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:30,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1179|]. (let ((.cse0 (select |v_#memory_int_1179| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:30,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1180|]. (let ((.cse0 (select |v_#memory_int_1180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:30:30,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:30,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1181|]. (let ((.cse0 (select |v_#memory_int_1181| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:30,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:30,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:30,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:30,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:30,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:30,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:30,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1182|]. (let ((.cse0 (select |v_#memory_int_1182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:30:30,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:30,995 INFO L273 TraceCheckUtils]: 0: Hoare triple {10448#true} havoc main_p1; {10448#true} is VALID [2019-05-15 10:30:30,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {10448#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10448#true} is VALID [2019-05-15 10:30:30,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {10448#true} #memory_int := #memory_int[main_p1 := 0]; {10459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:30,997 INFO L273 TraceCheckUtils]: 3: Hoare triple {10459#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:30,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {10463#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:30,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {10467#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:31,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {10471#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:31,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {10475#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:31,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {10479#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:31,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {10483#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:31,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {10487#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10491#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:31,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {10491#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10495#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:31,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {10495#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10499#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:31,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {10499#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10503#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:31,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {10503#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10507#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:31,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {10507#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10511#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:31,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {10511#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10515#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:31,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {10515#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10519#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:31,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {10519#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10523#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:31,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {10523#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10527#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:31,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {10527#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10531#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:31,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {10531#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10535#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:31,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {10535#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10539#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:31,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {10539#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10543#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:31,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {10543#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10547#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:31,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {10547#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10551#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:31,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {10551#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10555#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:31,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {10555#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10559#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:31,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {10559#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10563#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:31,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {10563#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10567#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:31,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {10567#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10571#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:31,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {10571#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10575#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:31,020 INFO L273 TraceCheckUtils]: 32: Hoare triple {10575#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10579#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:31,021 INFO L273 TraceCheckUtils]: 33: Hoare triple {10579#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10583#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:31,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {10583#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10587#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:31,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {10587#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10591#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:31,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {10591#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10595#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:31,024 INFO L273 TraceCheckUtils]: 37: Hoare triple {10595#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10599#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:31,025 INFO L273 TraceCheckUtils]: 38: Hoare triple {10599#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10603#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:31,025 INFO L273 TraceCheckUtils]: 39: Hoare triple {10603#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10607#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:31,026 INFO L273 TraceCheckUtils]: 40: Hoare triple {10607#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10611#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:31,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {10611#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10615#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:31,028 INFO L273 TraceCheckUtils]: 42: Hoare triple {10615#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10619#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:31,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {10619#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10623#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:31,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {10623#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10627#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:31,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {10627#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10631#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:31,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {10631#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10635#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:31,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {10635#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10639#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:31,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {10639#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10643#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:31,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {10643#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10647#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:31,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {10647#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} assume !(#memory_int[main_p1] >= 0); {10449#false} is VALID [2019-05-15 10:30:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:31,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-15 10:30:31,039 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-05-15 10:30:31,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:31,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2019-05-15 10:30:31,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:31,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-05-15 10:30:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-15 10:30:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:31,080 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 50 states. [2019-05-15 10:30:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:36,117 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-15 10:30:36,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 51 [2019-05-15 10:30:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:36,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-05-15 10:30:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-05-15 10:30:36,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2019-05-15 10:30:36,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:36,171 INFO L225 Difference]: With dead ends: 53 [2019-05-15 10:30:36,171 INFO L226 Difference]: Without dead ends: 53 [2019-05-15 10:30:36,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-05-15 10:30:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-05-15 10:30:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-05-15 10:30:36,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:36,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:36,174 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:36,174 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:36,175 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:36,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:36,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:36,175 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:36,175 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2019-05-15 10:30:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:36,176 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-05-15 10:30:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:36,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:36,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:36,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:36,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:30:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-05-15 10:30:36,177 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-05-15 10:30:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:36,177 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-05-15 10:30:36,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-05-15 10:30:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-05-15 10:30:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-05-15 10:30:36,178 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:36,178 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-05-15 10:30:36,178 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1321531000, now seen corresponding path program 48 times [2019-05-15 10:30:36,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:36,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-15 10:30:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:36,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:36,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:36,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:36,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1183|]. (= (store |v_#memory_int_1183| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:36,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:36,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1184|]. (let ((.cse0 (select |v_#memory_int_1184| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:36,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1185|]. (let ((.cse0 (select |v_#memory_int_1185| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1185| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:36,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:36,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,315 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1186|]. (let ((.cse0 (select |v_#memory_int_1186| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:30:36,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:36,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1187|]. (let ((.cse0 (select |v_#memory_int_1187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:36,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:36,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,363 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1188|]. (let ((.cse0 (select |v_#memory_int_1188| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1188| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:30:36,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:36,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1189|]. (let ((.cse0 (select |v_#memory_int_1189| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:36,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1190|]. (let ((.cse0 (select |v_#memory_int_1190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:30:36,412 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:36,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1191|]. (let ((.cse0 (select |v_#memory_int_1191| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_1191| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:36,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:36,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1192|]. (let ((.cse0 (select |v_#memory_int_1192| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:36,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1193|]. (let ((.cse0 (select |v_#memory_int_1193| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_1193| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:36,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:36,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1194|]. (let ((.cse0 (select |v_#memory_int_1194| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:36,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1195|]. (let ((.cse0 (select |v_#memory_int_1195| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:36,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,583 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1196|]. (let ((.cse0 (select |v_#memory_int_1196| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1196| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:30:36,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:36,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1197|]. (let ((.cse0 (select |v_#memory_int_1197| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_1197| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:36,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:36,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1198|]. (let ((.cse0 (select |v_#memory_int_1198| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1198| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:30:36,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:36,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1199|]. (let ((.cse0 (select |v_#memory_int_1199| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1199| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:36,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1200|]. (let ((.cse0 (select |v_#memory_int_1200| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_1200| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:36,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1201|]. (let ((.cse0 (select |v_#memory_int_1201| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_1201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:36,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,787 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,787 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1202|]. (let ((.cse0 (select |v_#memory_int_1202| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1202| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:30:36,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:36,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,823 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1203|]. (let ((.cse0 (select |v_#memory_int_1203| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:30:36,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:36,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1204|]. (let ((.cse0 (select |v_#memory_int_1204| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_1204| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:36,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:36,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1205|]. (let ((.cse0 (select |v_#memory_int_1205| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:36,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:36,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1206|]. (let ((.cse0 (select |v_#memory_int_1206| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1206| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:30:36,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:36,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:36,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:36,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:36,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:36,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:36,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1207|]. (let ((.cse0 (select |v_#memory_int_1207| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:36,979 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:37,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1208|]. (let ((.cse0 (select |v_#memory_int_1208| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1208| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:30:37,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:37,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1209|]. (let ((.cse0 (select |v_#memory_int_1209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:30:37,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:37,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,107 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1210|]. (let ((.cse0 (select |v_#memory_int_1210| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_1210| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:37,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:37,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1211|]. (let ((.cse0 (select |v_#memory_int_1211| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1211| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:30:37,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:37,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1212|]. (let ((.cse0 (select |v_#memory_int_1212| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:37,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:37,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1213|]. (let ((.cse0 (select |v_#memory_int_1213| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:37,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1214|]. (let ((.cse0 (select |v_#memory_int_1214| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:37,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1215|]. (let ((.cse0 (select |v_#memory_int_1215| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1215| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:30:37,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:37,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1216|]. (let ((.cse0 (select |v_#memory_int_1216| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_1216| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:37,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1217|]. (let ((.cse0 (select |v_#memory_int_1217| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= |#memory_int| (store |v_#memory_int_1217| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:37,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:37,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1218|]. (let ((.cse0 (select |v_#memory_int_1218| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:37,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,533 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1219|]. (let ((.cse0 (select |v_#memory_int_1219| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:37,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1220|]. (let ((.cse0 (select |v_#memory_int_1220| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1220| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:30:37,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:37,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1221|]. (let ((.cse0 (select |v_#memory_int_1221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:30:37,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:37,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1222|]. (let ((.cse0 (select |v_#memory_int_1222| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1222| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:30:37,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:37,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1223|]. (let ((.cse0 (select |v_#memory_int_1223| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:37,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:37,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,806 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1224|]. (let ((.cse0 (select |v_#memory_int_1224| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:30:37,806 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:37,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,862 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1225|]. (let ((.cse0 (select |v_#memory_int_1225| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1225| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:30:37,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:37,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1226|]. (let ((.cse0 (select |v_#memory_int_1226| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1226| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:30:37,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:37,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:37,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:37,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:37,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:37,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:37,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1227|]. (let ((.cse0 (select |v_#memory_int_1227| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_1227| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:37,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:38,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:38,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:38,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:38,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:38,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1228|]. (let ((.cse0 (select |v_#memory_int_1228| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1228| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:30:38,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:38,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:38,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:38,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:38,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:38,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1229|]. (let ((.cse0 (select |v_#memory_int_1229| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1229| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:38,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:38,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:38,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:38,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:38,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:38,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1230|]. (let ((.cse0 (select |v_#memory_int_1230| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1230| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:38,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:38,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:38,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:38,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:38,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:38,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:38,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1231|]. (let ((.cse0 (select |v_#memory_int_1231| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1231| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 47))) [2019-05-15 10:30:38,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:30:38,285 INFO L273 TraceCheckUtils]: 0: Hoare triple {10862#true} havoc main_p1; {10862#true} is VALID [2019-05-15 10:30:38,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {10862#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {10862#true} is VALID [2019-05-15 10:30:38,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {10862#true} #memory_int := #memory_int[main_p1 := 0]; {10873#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:38,287 INFO L273 TraceCheckUtils]: 3: Hoare triple {10873#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10877#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:38,287 INFO L273 TraceCheckUtils]: 4: Hoare triple {10877#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10881#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:38,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {10881#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10885#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:38,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {10885#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10889#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:38,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {10889#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10893#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:38,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {10893#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10897#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:38,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {10897#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10901#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:38,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {10901#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10905#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:38,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {10905#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10909#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:38,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {10909#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10913#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:38,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {10913#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10917#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:38,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {10917#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10921#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:38,296 INFO L273 TraceCheckUtils]: 15: Hoare triple {10921#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10925#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:38,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {10925#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10929#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:38,297 INFO L273 TraceCheckUtils]: 17: Hoare triple {10929#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10933#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:38,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {10933#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10937#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:38,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {10937#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10941#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:38,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {10941#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10945#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:38,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {10945#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10949#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:38,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {10949#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10953#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:38,321 INFO L273 TraceCheckUtils]: 23: Hoare triple {10953#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10957#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:38,322 INFO L273 TraceCheckUtils]: 24: Hoare triple {10957#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10961#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:38,322 INFO L273 TraceCheckUtils]: 25: Hoare triple {10961#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10965#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:38,323 INFO L273 TraceCheckUtils]: 26: Hoare triple {10965#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10969#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:38,323 INFO L273 TraceCheckUtils]: 27: Hoare triple {10969#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10973#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:38,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {10973#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10977#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:38,324 INFO L273 TraceCheckUtils]: 29: Hoare triple {10977#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10981#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:38,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {10981#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10985#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:38,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {10985#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10989#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:38,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {10989#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10993#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:38,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {10993#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {10997#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:38,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {10997#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11001#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:38,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {11001#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11005#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:38,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {11005#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11009#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:38,331 INFO L273 TraceCheckUtils]: 37: Hoare triple {11009#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11013#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:38,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {11013#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11017#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:38,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {11017#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11021#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:38,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {11021#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11025#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:38,334 INFO L273 TraceCheckUtils]: 41: Hoare triple {11025#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11029#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:38,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {11029#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11033#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:38,335 INFO L273 TraceCheckUtils]: 43: Hoare triple {11033#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11037#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:38,336 INFO L273 TraceCheckUtils]: 44: Hoare triple {11037#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11041#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:38,337 INFO L273 TraceCheckUtils]: 45: Hoare triple {11041#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11045#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:38,337 INFO L273 TraceCheckUtils]: 46: Hoare triple {11045#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11049#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:38,338 INFO L273 TraceCheckUtils]: 47: Hoare triple {11049#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11053#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:38,339 INFO L273 TraceCheckUtils]: 48: Hoare triple {11053#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11057#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:38,340 INFO L273 TraceCheckUtils]: 49: Hoare triple {11057#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11061#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:38,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {11061#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11065#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:30:38,341 INFO L273 TraceCheckUtils]: 51: Hoare triple {11065#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} assume !(#memory_int[main_p1] >= 0); {10863#false} is VALID [2019-05-15 10:30:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:38,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:38,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-15 10:30:38,347 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-05-15 10:30:38,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:38,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2019-05-15 10:30:38,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:38,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-05-15 10:30:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-15 10:30:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-05-15 10:30:38,391 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 51 states. [2019-05-15 10:30:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:43,511 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-15 10:30:43,511 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 52 [2019-05-15 10:30:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-05-15 10:30:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-05-15 10:30:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-05-15 10:30:43,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2019-05-15 10:30:43,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:43,557 INFO L225 Difference]: With dead ends: 54 [2019-05-15 10:30:43,557 INFO L226 Difference]: Without dead ends: 54 [2019-05-15 10:30:43,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-05-15 10:30:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-05-15 10:30:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-05-15 10:30:43,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:43,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:43,560 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:43,560 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:43,563 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:43,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:43,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:43,564 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:43,564 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2019-05-15 10:30:43,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:43,565 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-05-15 10:30:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:43,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:43,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:43,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:43,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:30:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-05-15 10:30:43,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-05-15 10:30:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:43,566 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-05-15 10:30:43,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-05-15 10:30:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-05-15 10:30:43,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-05-15 10:30:43,567 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:43,567 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-05-15 10:30:43,567 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1982211906, now seen corresponding path program 49 times [2019-05-15 10:30:43,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:43,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-15 10:30:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:43,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:43,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:43,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:43,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1232|]. (= (store |v_#memory_int_1232| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:43,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:43,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1233|]. (let ((.cse0 (select |v_#memory_int_1233| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_1233| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:43,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:43,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1234|]. (let ((.cse0 (select |v_#memory_int_1234| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1234| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:30:43,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:43,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1235|]. (let ((.cse0 (select |v_#memory_int_1235| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:30:43,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:43,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1236|]. (let ((.cse0 (select |v_#memory_int_1236| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:30:43,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:43,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1237|]. (let ((.cse0 (select |v_#memory_int_1237| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1237| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:30:43,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:43,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1238|]. (let ((.cse0 (select |v_#memory_int_1238| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1238| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:43,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:43,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1239|]. (let ((.cse0 (select |v_#memory_int_1239| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:43,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:43,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1240|]. (let ((.cse0 (select |v_#memory_int_1240| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:30:43,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:43,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,905 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1241|]. (let ((.cse0 (select |v_#memory_int_1241| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1241| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:30:43,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:43,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1242|]. (let ((.cse0 (select |v_#memory_int_1242| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:30:43,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:43,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1243|]. (let ((.cse0 (select |v_#memory_int_1243| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:30:43,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:43,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:43,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:43,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:43,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:43,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:43,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1244|]. (let ((.cse0 (select |v_#memory_int_1244| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:43,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:44,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1245|]. (let ((.cse0 (select |v_#memory_int_1245| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:44,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1246|]. (let ((.cse0 (select |v_#memory_int_1246| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:30:44,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:44,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1247|]. (let ((.cse0 (select |v_#memory_int_1247| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:44,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1248|]. (let ((.cse0 (select |v_#memory_int_1248| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1248| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:44,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1249|]. (let ((.cse0 (select |v_#memory_int_1249| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1249| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:44,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,175 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1250|]. (let ((.cse0 (select |v_#memory_int_1250| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1250| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:44,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:44,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1251|]. (let ((.cse0 (select |v_#memory_int_1251| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_1251| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:44,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1252|]. (let ((.cse0 (select |v_#memory_int_1252| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1252| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:30:44,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:44,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1253|]. (let ((.cse0 (select |v_#memory_int_1253| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:44,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1254|]. (let ((.cse0 (select |v_#memory_int_1254| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_1254| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:44,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1255|]. (let ((.cse0 (select |v_#memory_int_1255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:30:44,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:44,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1256|]. (let ((.cse0 (select |v_#memory_int_1256| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1256| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:30:44,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:44,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1257|]. (let ((.cse0 (select |v_#memory_int_1257| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1257| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:30:44,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:44,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1258|]. (let ((.cse0 (select |v_#memory_int_1258| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_1258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:44,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,511 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1259|]. (let ((.cse0 (select |v_#memory_int_1259| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:30:44,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:44,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1260|]. (let ((.cse0 (select |v_#memory_int_1260| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_1260| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:44,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1261|]. (let ((.cse0 (select |v_#memory_int_1261| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1261| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:30:44,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:44,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1262|]. (let ((.cse0 (select |v_#memory_int_1262| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1262| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:30:44,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:44,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1263|]. (let ((.cse0 (select |v_#memory_int_1263| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:30:44,705 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:44,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1264|]. (let ((.cse0 (select |v_#memory_int_1264| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_1264| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:44,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1265|]. (let ((.cse0 (select |v_#memory_int_1265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:30:44,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:44,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1266|]. (let ((.cse0 (select |v_#memory_int_1266| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:44,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1267|]. (let ((.cse0 (select |v_#memory_int_1267| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_1267| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:44,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1268|]. (let ((.cse0 (select |v_#memory_int_1268| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:44,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:44,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:44,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:44,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:44,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:44,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:44,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1269|]. (let ((.cse0 (select |v_#memory_int_1269| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_1269| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:44,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:45,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,094 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,094 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1270|]. (let ((.cse0 (select |v_#memory_int_1270| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:30:45,094 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:45,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1271|]. (let ((.cse0 (select |v_#memory_int_1271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:30:45,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:45,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1272|]. (let ((.cse0 (select |v_#memory_int_1272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:30:45,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:45,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1273|]. (let ((.cse0 (select |v_#memory_int_1273| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:30:45,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:45,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1274|]. (let ((.cse0 (select |v_#memory_int_1274| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1274| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:30:45,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:45,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1275|]. (let ((.cse0 (select |v_#memory_int_1275| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:45,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:45,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1276|]. (let ((.cse0 (select |v_#memory_int_1276| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:30:45,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:45,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1277|]. (let ((.cse0 (select |v_#memory_int_1277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:30:45,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:45,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,732 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1278|]. (let ((.cse0 (select |v_#memory_int_1278| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1278| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:45,732 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:45,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1279|]. (let ((.cse0 (select |v_#memory_int_1279| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1279| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:30:45,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:45,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1280|]. (let ((.cse0 (select |v_#memory_int_1280| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_1280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:45,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:30:45,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:45,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:45,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:45,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:45,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:45,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1281|]. (let ((.cse0 (select |v_#memory_int_1281| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:30:45,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:30:45,948 INFO L273 TraceCheckUtils]: 0: Hoare triple {11284#true} havoc main_p1; {11284#true} is VALID [2019-05-15 10:30:45,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {11284#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {11284#true} is VALID [2019-05-15 10:30:45,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {11284#true} #memory_int := #memory_int[main_p1 := 0]; {11295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:45,949 INFO L273 TraceCheckUtils]: 3: Hoare triple {11295#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:45,950 INFO L273 TraceCheckUtils]: 4: Hoare triple {11299#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:45,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {11303#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:45,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {11307#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:45,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {11311#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:45,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {11315#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11319#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:45,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {11319#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11323#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:45,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {11323#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11327#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:45,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {11327#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11331#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:45,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {11331#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11335#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:45,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {11335#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11339#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:45,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {11339#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11343#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:45,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {11343#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11347#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:45,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {11347#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11351#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:45,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {11351#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11355#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:45,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {11355#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11359#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:45,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {11359#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11363#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:45,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {11363#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11367#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:45,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {11367#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11371#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:45,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {11371#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11375#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:45,963 INFO L273 TraceCheckUtils]: 23: Hoare triple {11375#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11379#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:45,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {11379#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11383#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:45,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {11383#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11387#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:45,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {11387#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11391#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:45,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {11391#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11395#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:45,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {11395#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11399#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:45,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {11399#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11403#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:45,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {11403#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11407#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:45,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {11407#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11411#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:45,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {11411#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11415#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:45,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {11415#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11419#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:45,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {11419#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11423#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:45,973 INFO L273 TraceCheckUtils]: 35: Hoare triple {11423#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11427#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:45,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {11427#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11431#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:45,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {11431#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11435#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:45,975 INFO L273 TraceCheckUtils]: 38: Hoare triple {11435#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11439#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:45,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {11439#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11443#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:45,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {11443#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11447#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:45,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {11447#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11451#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:45,978 INFO L273 TraceCheckUtils]: 42: Hoare triple {11451#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11455#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:45,979 INFO L273 TraceCheckUtils]: 43: Hoare triple {11455#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11459#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:45,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {11459#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11463#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:45,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {11463#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11467#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:45,981 INFO L273 TraceCheckUtils]: 46: Hoare triple {11467#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11471#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:45,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {11471#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11475#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:45,983 INFO L273 TraceCheckUtils]: 48: Hoare triple {11475#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11479#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:45,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {11479#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11483#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:45,984 INFO L273 TraceCheckUtils]: 50: Hoare triple {11483#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11487#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:30:45,985 INFO L273 TraceCheckUtils]: 51: Hoare triple {11487#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11491#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:30:45,985 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} assume !(#memory_int[main_p1] >= 0); {11285#false} is VALID [2019-05-15 10:30:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:45,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:45,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-15 10:30:45,991 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-05-15 10:30:45,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:45,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2019-05-15 10:30:46,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:46,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-05-15 10:30:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-15 10:30:46,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:30:46,070 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 52 states. [2019-05-15 10:30:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:51,434 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-15 10:30:51,434 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 53 [2019-05-15 10:30:51,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:30:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-05-15 10:30:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-05-15 10:30:51,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2019-05-15 10:30:51,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:51,481 INFO L225 Difference]: With dead ends: 55 [2019-05-15 10:30:51,481 INFO L226 Difference]: Without dead ends: 55 [2019-05-15 10:30:51,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-05-15 10:30:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-05-15 10:30:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-05-15 10:30:51,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:51,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:51,483 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:51,484 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:51,484 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:51,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:51,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:51,485 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:51,485 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2019-05-15 10:30:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:51,486 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-05-15 10:30:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:51,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:51,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:51,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:51,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:30:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-05-15 10:30:51,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-05-15 10:30:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:51,488 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-05-15 10:30:51,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-05-15 10:30:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-05-15 10:30:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-05-15 10:30:51,488 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:51,488 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-05-15 10:30:51,488 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1319026888, now seen corresponding path program 50 times [2019-05-15 10:30:51,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:51,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-15 10:30:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:51,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:51,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:51,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:51,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1282|]. (= |#memory_int| (store |v_#memory_int_1282| ULTIMATE.start_main_p1 0)) [2019-05-15 10:30:51,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:51,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1283|]. (let ((.cse0 (select |v_#memory_int_1283| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1283| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:51,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1284|]. (let ((.cse0 (select |v_#memory_int_1284| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:51,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1285|]. (let ((.cse0 (select |v_#memory_int_1285| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1285| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:30:51,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:51,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1286|]. (let ((.cse0 (select |v_#memory_int_1286| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_1286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:51,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1287|]. (let ((.cse0 (select |v_#memory_int_1287| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1287| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:30:51,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:51,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1288|]. (let ((.cse0 (select |v_#memory_int_1288| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:51,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1289|]. (let ((.cse0 (select |v_#memory_int_1289| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1289| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:51,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1290|]. (let ((.cse0 (select |v_#memory_int_1290| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_1290| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,764 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:51,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1291|]. (let ((.cse0 (select |v_#memory_int_1291| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:51,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1292|]. (let ((.cse0 (select |v_#memory_int_1292| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1292| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:30:51,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:51,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1293|]. (let ((.cse0 (select |v_#memory_int_1293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:30:51,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:51,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1294|]. (let ((.cse0 (select |v_#memory_int_1294| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_1294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:51,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1295|]. (let ((.cse0 (select |v_#memory_int_1295| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:51,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1296|]. (let ((.cse0 (select |v_#memory_int_1296| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1296| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:51,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1297|]. (let ((.cse0 (select |v_#memory_int_1297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:30:51,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:51,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:51,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:51,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:51,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:51,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:51,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1298|]. (let ((.cse0 (select |v_#memory_int_1298| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:51,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:52,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1299|]. (let ((.cse0 (select |v_#memory_int_1299| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:52,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1300|]. (let ((.cse0 (select |v_#memory_int_1300| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:30:52,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:52,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1301|]. (let ((.cse0 (select |v_#memory_int_1301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:30:52,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:30:52,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1302|]. (let ((.cse0 (select |v_#memory_int_1302| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:30:52,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:30:52,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1303|]. (let ((.cse0 (select |v_#memory_int_1303| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1303| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:30:52,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:30:52,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1304|]. (let ((.cse0 (select |v_#memory_int_1304| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:30:52,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:30:52,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1305|]. (let ((.cse0 (select |v_#memory_int_1305| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1305| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:30:52,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:30:52,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1306|]. (let ((.cse0 (select |v_#memory_int_1306| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:30:52,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1307|]. (let ((.cse0 (select |v_#memory_int_1307| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1307| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:52,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:30:52,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1308|]. (let ((.cse0 (select |v_#memory_int_1308| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1308| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:30:52,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:30:52,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1309|]. (let ((.cse0 (select |v_#memory_int_1309| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:30:52,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:30:52,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1310|]. (let ((.cse0 (select |v_#memory_int_1310| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_1310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:30:52,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,483 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1311|]. (let ((.cse0 (select |v_#memory_int_1311| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1311| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:30:52,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:30:52,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1312|]. (let ((.cse0 (select |v_#memory_int_1312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:30:52,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:30:52,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1313|]. (let ((.cse0 (select |v_#memory_int_1313| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:30:52,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,614 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1314|]. (let ((.cse0 (select |v_#memory_int_1314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:30:52,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:30:52,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1315|]. (let ((.cse0 (select |v_#memory_int_1315| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1315| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:30:52,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:30:52,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1316|]. (let ((.cse0 (select |v_#memory_int_1316| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:30:52,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:30:52,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1317|]. (let ((.cse0 (select |v_#memory_int_1317| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_1317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:30:52,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1318|]. (let ((.cse0 (select |v_#memory_int_1318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:30:52,835 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:30:52,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1319|]. (let ((.cse0 (select |v_#memory_int_1319| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_1319| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:52,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:30:52,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1320|]. (let ((.cse0 (select |v_#memory_int_1320| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1320| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:52,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:30:52,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:52,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:52,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:52,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:52,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:52,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1321|]. (let ((.cse0 (select |v_#memory_int_1321| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_1321| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:52,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:30:53,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1322|]. (let ((.cse0 (select |v_#memory_int_1322| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1322| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:30:53,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:30:53,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1323|]. (let ((.cse0 (select |v_#memory_int_1323| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:53,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:30:53,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1324|]. (let ((.cse0 (select |v_#memory_int_1324| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1324| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:30:53,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:30:53,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1325|]. (let ((.cse0 (select |v_#memory_int_1325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:30:53,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:30:53,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1326|]. (let ((.cse0 (select |v_#memory_int_1326| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:53,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:30:53,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1327|]. (let ((.cse0 (select |v_#memory_int_1327| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:30:53,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:30:53,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1328|]. (let ((.cse0 (select |v_#memory_int_1328| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:30:53,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:30:53,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1329|]. (let ((.cse0 (select |v_#memory_int_1329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:30:53,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:30:53,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1330|]. (let ((.cse0 (select |v_#memory_int_1330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:30:53,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:30:53,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1331|]. (let ((.cse0 (select |v_#memory_int_1331| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:53,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:30:53,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:53,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:53,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:53,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:53,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:53,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1332|]. (let ((.cse0 (select |v_#memory_int_1332| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:30:53,581 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:30:53,627 INFO L273 TraceCheckUtils]: 0: Hoare triple {11714#true} havoc main_p1; {11714#true} is VALID [2019-05-15 10:30:53,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {11714#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {11714#true} is VALID [2019-05-15 10:30:53,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {11714#true} #memory_int := #memory_int[main_p1 := 0]; {11725#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:30:53,629 INFO L273 TraceCheckUtils]: 3: Hoare triple {11725#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11729#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:30:53,629 INFO L273 TraceCheckUtils]: 4: Hoare triple {11729#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11733#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:30:53,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {11733#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11737#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:30:53,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {11737#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11741#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:30:53,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {11741#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11745#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:30:53,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {11745#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11749#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:30:53,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {11749#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11753#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:30:53,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {11753#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11757#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:30:53,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {11757#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11761#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:30:53,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {11761#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11765#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:30:53,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {11765#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11769#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:30:53,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {11769#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11773#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:30:53,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {11773#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11777#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:30:53,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {11777#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11781#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:30:53,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {11781#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11785#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:30:53,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {11785#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11789#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:30:53,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {11789#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11793#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:30:53,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {11793#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11797#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:30:53,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {11797#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11801#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:30:53,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {11801#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11805#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:30:53,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {11805#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11809#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:30:53,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {11809#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11813#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:30:53,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {11813#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11817#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:30:53,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {11817#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11821#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:30:53,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {11821#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11825#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:30:53,647 INFO L273 TraceCheckUtils]: 28: Hoare triple {11825#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11829#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:30:53,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {11829#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11833#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:30:53,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {11833#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11837#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:30:53,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {11837#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11841#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:30:53,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {11841#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11845#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:30:53,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {11845#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11849#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:30:53,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {11849#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11853#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:30:53,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {11853#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11857#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:30:53,653 INFO L273 TraceCheckUtils]: 36: Hoare triple {11857#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11861#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:30:53,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {11861#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11865#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:30:53,655 INFO L273 TraceCheckUtils]: 38: Hoare triple {11865#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11869#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:30:53,655 INFO L273 TraceCheckUtils]: 39: Hoare triple {11869#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11873#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:30:53,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {11873#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11877#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:30:53,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {11877#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11881#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:30:53,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {11881#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11885#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:30:53,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {11885#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11889#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:30:53,659 INFO L273 TraceCheckUtils]: 44: Hoare triple {11889#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11893#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:30:53,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {11893#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11897#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:30:53,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {11897#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11901#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:30:53,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {11901#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11905#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:30:53,662 INFO L273 TraceCheckUtils]: 48: Hoare triple {11905#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11909#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:30:53,663 INFO L273 TraceCheckUtils]: 49: Hoare triple {11909#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11913#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:30:53,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {11913#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11917#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:30:53,664 INFO L273 TraceCheckUtils]: 51: Hoare triple {11917#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11921#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:30:53,665 INFO L273 TraceCheckUtils]: 52: Hoare triple {11921#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {11925#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:30:53,666 INFO L273 TraceCheckUtils]: 53: Hoare triple {11925#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} assume !(#memory_int[main_p1] >= 0); {11715#false} is VALID [2019-05-15 10:30:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:30:53,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:30:53,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-15 10:30:53,672 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-05-15 10:30:53,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:30:53,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2019-05-15 10:30:53,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:53,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-05-15 10:30:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-15 10:30:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-05-15 10:30:53,722 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 53 states. [2019-05-15 10:30:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:59,290 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:30:59,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-15 10:30:59,290 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 54 [2019-05-15 10:30:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:30:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:30:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-05-15 10:30:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-05-15 10:30:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-05-15 10:30:59,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2019-05-15 10:30:59,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:30:59,337 INFO L225 Difference]: With dead ends: 56 [2019-05-15 10:30:59,337 INFO L226 Difference]: Without dead ends: 56 [2019-05-15 10:30:59,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-05-15 10:30:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-05-15 10:30:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-05-15 10:30:59,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:30:59,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2019-05-15 10:30:59,339 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2019-05-15 10:30:59,339 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2019-05-15 10:30:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:59,340 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:30:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:30:59,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:59,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:59,340 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2019-05-15 10:30:59,340 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2019-05-15 10:30:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:30:59,341 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-05-15 10:30:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:30:59,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:30:59,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:30:59,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:30:59,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:30:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:30:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-05-15 10:30:59,342 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-05-15 10:30:59,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:30:59,342 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-05-15 10:30:59,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-05-15 10:30:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-05-15 10:30:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-05-15 10:30:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:30:59,343 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-05-15 10:30:59,343 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:30:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:30:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2059839486, now seen corresponding path program 51 times [2019-05-15 10:30:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:30:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:59,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-15 10:30:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:30:59,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:30:59,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:30:59,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:30:59,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1333|]. (= (store |v_#memory_int_1333| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:30:59,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:30:59,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1334|]. (let ((.cse0 (select |v_#memory_int_1334| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_1334| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:59,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:30:59,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1335|]. (let ((.cse0 (select |v_#memory_int_1335| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:30:59,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:30:59,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,492 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1336|]. (let ((.cse0 (select |v_#memory_int_1336| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1336| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:30:59,492 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:30:59,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1337|]. (let ((.cse0 (select |v_#memory_int_1337| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1337| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:30:59,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:30:59,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1338|]. (let ((.cse0 (select |v_#memory_int_1338| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_1338| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:30:59,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1339|]. (let ((.cse0 (select |v_#memory_int_1339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:30:59,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:30:59,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1340|]. (let ((.cse0 (select |v_#memory_int_1340| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_1340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:30:59,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,614 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1341|]. (let ((.cse0 (select |v_#memory_int_1341| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1341| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:30:59,614 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:30:59,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1342|]. (let ((.cse0 (select |v_#memory_int_1342| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:30:59,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1343|]. (let ((.cse0 (select |v_#memory_int_1343| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_1343| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:30:59,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1344|]. (let ((.cse0 (select |v_#memory_int_1344| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:30:59,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1345|]. (let ((.cse0 (select |v_#memory_int_1345| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:30:59,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1346|]. (let ((.cse0 (select |v_#memory_int_1346| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:30:59,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:30:59,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1347|]. (let ((.cse0 (select |v_#memory_int_1347| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:30:59,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:30:59,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1348|]. (let ((.cse0 (select |v_#memory_int_1348| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1348| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:30:59,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:30:59,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,842 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1349|]. (let ((.cse0 (select |v_#memory_int_1349| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:30:59,842 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:30:59,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1350|]. (let ((.cse0 (select |v_#memory_int_1350| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_1350| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:30:59,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:30:59,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:30:59,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:30:59,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:30:59,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:30:59,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1351|]. (let ((.cse0 (select |v_#memory_int_1351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:30:59,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:30:59,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:30:59,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1352|]. (let ((.cse0 (select |v_#memory_int_1352| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:31:00,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:00,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,048 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1353|]. (let ((.cse0 (select |v_#memory_int_1353| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:31:00,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:00,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,083 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1354|]. (let ((.cse0 (select |v_#memory_int_1354| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1354| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:31:00,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:00,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,121 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1355|]. (let ((.cse0 (select |v_#memory_int_1355| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_1355| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:00,121 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:00,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1356|]. (let ((.cse0 (select |v_#memory_int_1356| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1356| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:31:00,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:00,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1357|]. (let ((.cse0 (select |v_#memory_int_1357| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:00,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1358|]. (let ((.cse0 (select |v_#memory_int_1358| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1358| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 24 .cse0))) [2019-05-15 10:31:00,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:00,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1359|]. (let ((.cse0 (select |v_#memory_int_1359| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_1359| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:00,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1360|]. (let ((.cse0 (select |v_#memory_int_1360| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:31:00,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:00,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1361|]. (let ((.cse0 (select |v_#memory_int_1361| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:00,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1362|]. (let ((.cse0 (select |v_#memory_int_1362| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1362| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:00,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:00,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1363|]. (let ((.cse0 (select |v_#memory_int_1363| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_1363| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:00,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1364|]. (let ((.cse0 (select |v_#memory_int_1364| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1364| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:00,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:00,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1365|]. (let ((.cse0 (select |v_#memory_int_1365| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1365| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:00,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1366|]. (let ((.cse0 (select |v_#memory_int_1366| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:00,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:00,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1367|]. (let ((.cse0 (select |v_#memory_int_1367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:31:00,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:00,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1368|]. (let ((.cse0 (select |v_#memory_int_1368| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1368| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:00,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:00,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1369|]. (let ((.cse0 (select |v_#memory_int_1369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:31:00,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:00,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1370|]. (let ((.cse0 (select |v_#memory_int_1370| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1370| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:31:00,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:00,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:00,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:00,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:00,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:00,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:00,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1371|]. (let ((.cse0 (select |v_#memory_int_1371| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1371| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:31:00,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:01,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1372|]. (let ((.cse0 (select |v_#memory_int_1372| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:01,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:01,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1373|]. (let ((.cse0 (select |v_#memory_int_1373| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1373| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:31:01,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:01,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1374|]. (let ((.cse0 (select |v_#memory_int_1374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:31:01,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:01,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1375|]. (let ((.cse0 (select |v_#memory_int_1375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:01,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:01,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1376|]. (let ((.cse0 (select |v_#memory_int_1376| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1376| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 42 .cse0))) [2019-05-15 10:31:01,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:01,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1377|]. (let ((.cse0 (select |v_#memory_int_1377| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:01,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:01,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1378|]. (let ((.cse0 (select |v_#memory_int_1378| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:01,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:01,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1379|]. (let ((.cse0 (select |v_#memory_int_1379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:31:01,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:01,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1380|]. (let ((.cse0 (select |v_#memory_int_1380| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:01,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:01,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1381|]. (let ((.cse0 (select |v_#memory_int_1381| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_1381| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:01,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:01,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1382|]. (let ((.cse0 (select |v_#memory_int_1382| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= |#memory_int| (store |v_#memory_int_1382| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:01,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:01,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1383|]. (let ((.cse0 (select |v_#memory_int_1383| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1383| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:31:01,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:01,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:01,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:01,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:01,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:01,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:01,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1384|]. (let ((.cse0 (select |v_#memory_int_1384| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_1384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:01,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:01,880 INFO L273 TraceCheckUtils]: 0: Hoare triple {12152#true} havoc main_p1; {12152#true} is VALID [2019-05-15 10:31:01,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {12152#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {12152#true} is VALID [2019-05-15 10:31:01,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {12152#true} #memory_int := #memory_int[main_p1 := 0]; {12163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:01,882 INFO L273 TraceCheckUtils]: 3: Hoare triple {12163#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:01,883 INFO L273 TraceCheckUtils]: 4: Hoare triple {12167#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:01,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {12171#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:01,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {12175#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12179#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:01,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {12179#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12183#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:01,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {12183#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12187#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:01,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {12187#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12191#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:01,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {12191#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12195#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:01,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {12195#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12199#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:01,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {12199#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12203#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:01,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {12203#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12207#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:01,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {12207#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12211#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:01,890 INFO L273 TraceCheckUtils]: 15: Hoare triple {12211#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12215#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:01,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {12215#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12219#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:01,891 INFO L273 TraceCheckUtils]: 17: Hoare triple {12219#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12223#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:01,892 INFO L273 TraceCheckUtils]: 18: Hoare triple {12223#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12227#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:01,893 INFO L273 TraceCheckUtils]: 19: Hoare triple {12227#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12231#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:01,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {12231#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12235#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:01,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {12235#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12239#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:01,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {12239#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12243#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:01,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {12243#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12247#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:01,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {12247#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12251#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:01,897 INFO L273 TraceCheckUtils]: 25: Hoare triple {12251#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12255#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:01,898 INFO L273 TraceCheckUtils]: 26: Hoare triple {12255#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12259#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:01,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {12259#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12263#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:01,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {12263#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12267#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:01,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {12267#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12271#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:01,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {12271#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12275#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:01,902 INFO L273 TraceCheckUtils]: 31: Hoare triple {12275#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12279#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:01,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {12279#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12283#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:01,903 INFO L273 TraceCheckUtils]: 33: Hoare triple {12283#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12287#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:01,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {12287#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12291#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:01,905 INFO L273 TraceCheckUtils]: 35: Hoare triple {12291#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12295#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:01,906 INFO L273 TraceCheckUtils]: 36: Hoare triple {12295#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12299#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:01,906 INFO L273 TraceCheckUtils]: 37: Hoare triple {12299#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12303#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:01,907 INFO L273 TraceCheckUtils]: 38: Hoare triple {12303#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12307#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:01,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {12307#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12311#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:01,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {12311#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12315#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:01,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {12315#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12319#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:01,910 INFO L273 TraceCheckUtils]: 42: Hoare triple {12319#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12323#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:01,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {12323#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12327#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:01,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {12327#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12331#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:01,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {12331#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12335#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:01,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {12335#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12339#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:01,914 INFO L273 TraceCheckUtils]: 47: Hoare triple {12339#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12343#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:01,915 INFO L273 TraceCheckUtils]: 48: Hoare triple {12343#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12347#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:01,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {12347#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12351#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:01,916 INFO L273 TraceCheckUtils]: 50: Hoare triple {12351#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12355#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:01,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {12355#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12359#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:01,918 INFO L273 TraceCheckUtils]: 52: Hoare triple {12359#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12363#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:01,918 INFO L273 TraceCheckUtils]: 53: Hoare triple {12363#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12367#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:01,919 INFO L273 TraceCheckUtils]: 54: Hoare triple {12367#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} assume !(#memory_int[main_p1] >= 0); {12153#false} is VALID [2019-05-15 10:31:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-15 10:31:01,924 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-05-15 10:31:01,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:01,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2019-05-15 10:31:01,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:01,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-05-15 10:31:01,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-15 10:31:01,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:31:01,970 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 54 states. [2019-05-15 10:31:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:07,723 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-15 10:31:07,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 55 [2019-05-15 10:31:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:31:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:31:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-05-15 10:31:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-05-15 10:31:07,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2019-05-15 10:31:07,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:07,772 INFO L225 Difference]: With dead ends: 57 [2019-05-15 10:31:07,772 INFO L226 Difference]: Without dead ends: 57 [2019-05-15 10:31:07,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-05-15 10:31:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-05-15 10:31:07,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-05-15 10:31:07,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:07,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:07,775 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:07,775 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:07,775 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:07,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:07,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:07,776 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:07,776 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2019-05-15 10:31:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:07,777 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-05-15 10:31:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:07,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:07,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:07,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:07,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-05-15 10:31:07,778 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-05-15 10:31:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:07,778 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-05-15 10:31:07,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-05-15 10:31:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-05-15 10:31:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-05-15 10:31:07,779 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:07,779 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-05-15 10:31:07,779 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash 569485320, now seen corresponding path program 52 times [2019-05-15 10:31:07,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:07,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-15 10:31:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:07,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:07,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:07,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:07,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:07,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:07,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1385|]. (= |#memory_int| (store |v_#memory_int_1385| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:07,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:07,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:07,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:07,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:07,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:07,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1386|]. (let ((.cse0 (select |v_#memory_int_1386| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1386| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:31:07,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:07,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:07,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:07,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:07,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:07,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1387|]. (let ((.cse0 (select |v_#memory_int_1387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:31:07,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:07,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:07,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:07,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:07,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:07,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:07,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1388|]. (let ((.cse0 (select |v_#memory_int_1388| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_1388| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:07,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:08,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1389|]. (let ((.cse0 (select |v_#memory_int_1389| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1389| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:31:08,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:08,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1390|]. (let ((.cse0 (select |v_#memory_int_1390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:31:08,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:08,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1391|]. (let ((.cse0 (select |v_#memory_int_1391| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1391| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:31:08,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:08,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1392|]. (let ((.cse0 (select |v_#memory_int_1392| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1392| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:08,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1393|]. (let ((.cse0 (select |v_#memory_int_1393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:31:08,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:08,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1394|]. (let ((.cse0 (select |v_#memory_int_1394| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_1394| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:08,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1395|]. (let ((.cse0 (select |v_#memory_int_1395| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= |#memory_int| (store |v_#memory_int_1395| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:08,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1396|]. (let ((.cse0 (select |v_#memory_int_1396| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1396| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:08,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:08,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1397|]. (let ((.cse0 (select |v_#memory_int_1397| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= |#memory_int| (store |v_#memory_int_1397| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:08,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1398|]. (let ((.cse0 (select |v_#memory_int_1398| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1398| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:31:08,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:08,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1399|]. (let ((.cse0 (select |v_#memory_int_1399| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:08,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1400|]. (let ((.cse0 (select |v_#memory_int_1400| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_1400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:08,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1401|]. (let ((.cse0 (select |v_#memory_int_1401| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_1401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:08,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1402|]. (let ((.cse0 (select |v_#memory_int_1402| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1402| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:31:08,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:08,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,448 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1403|]. (let ((.cse0 (select |v_#memory_int_1403| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,448 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:08,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1404|]. (let ((.cse0 (select |v_#memory_int_1404| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:08,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1405|]. (let ((.cse0 (select |v_#memory_int_1405| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:08,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1406|]. (let ((.cse0 (select |v_#memory_int_1406| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:31:08,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:08,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1407|]. (let ((.cse0 (select |v_#memory_int_1407| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1407| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:31:08,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:08,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1408|]. (let ((.cse0 (select |v_#memory_int_1408| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_1408| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:08,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1409|]. (let ((.cse0 (select |v_#memory_int_1409| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1409| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:31:08,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:08,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,754 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1410|]. (let ((.cse0 (select |v_#memory_int_1410| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1410| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,754 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:08,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1411|]. (let ((.cse0 (select |v_#memory_int_1411| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1411| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:08,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:08,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1412|]. (let ((.cse0 (select |v_#memory_int_1412| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1412| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:31:08,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:08,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1413|]. (let ((.cse0 (select |v_#memory_int_1413| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:08,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:08,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1414|]. (let ((.cse0 (select |v_#memory_int_1414| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:08,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:08,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:08,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:08,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:08,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:08,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1415|]. (let ((.cse0 (select |v_#memory_int_1415| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1415| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:08,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:08,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:08,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1416|]. (let ((.cse0 (select |v_#memory_int_1416| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_1416| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:09,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:09,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1417|]. (let ((.cse0 (select |v_#memory_int_1417| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1417| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:31:09,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:09,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1418|]. (let ((.cse0 (select |v_#memory_int_1418| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:31:09,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:09,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1419|]. (let ((.cse0 (select |v_#memory_int_1419| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1419| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:09,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:09,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1420|]. (let ((.cse0 (select |v_#memory_int_1420| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:31:09,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:09,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,242 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1421|]. (let ((.cse0 (select |v_#memory_int_1421| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_1421| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:09,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:09,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1422|]. (let ((.cse0 (select |v_#memory_int_1422| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_1422| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:09,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:09,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1423|]. (let ((.cse0 (select |v_#memory_int_1423| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1423| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:09,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:09,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1424|]. (let ((.cse0 (select |v_#memory_int_1424| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_1424| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:09,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:09,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,443 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,443 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1425|]. (let ((.cse0 (select |v_#memory_int_1425| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1425| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:31:09,443 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:09,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1426|]. (let ((.cse0 (select |v_#memory_int_1426| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_1426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:09,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:09,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1427|]. (let ((.cse0 (select |v_#memory_int_1427| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1427| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:31:09,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:09,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,601 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,601 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1428|]. (let ((.cse0 (select |v_#memory_int_1428| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:09,601 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:09,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1429|]. (let ((.cse0 (select |v_#memory_int_1429| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1429| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 43))) [2019-05-15 10:31:09,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:09,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1430|]. (let ((.cse0 (select |v_#memory_int_1430| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1430| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:09,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:09,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1431|]. (let ((.cse0 (select |v_#memory_int_1431| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1431| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:31:09,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:09,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1432|]. (let ((.cse0 (select |v_#memory_int_1432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:31:09,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:09,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1433|]. (let ((.cse0 (select |v_#memory_int_1433| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:09,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:09,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:09,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:09,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:09,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:09,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:09,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1434|]. (let ((.cse0 (select |v_#memory_int_1434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:31:09,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:10,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:10,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:10,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:10,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:10,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1435|]. (let ((.cse0 (select |v_#memory_int_1435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:31:10,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:10,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:10,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:10,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:10,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:10,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1436|]. (let ((.cse0 (select |v_#memory_int_1436| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1436| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:10,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:10,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:10,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:10,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:10,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:10,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:10,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1437|]. (let ((.cse0 (select |v_#memory_int_1437| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1437| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:10,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:10,219 INFO L273 TraceCheckUtils]: 0: Hoare triple {12598#true} havoc main_p1; {12598#true} is VALID [2019-05-15 10:31:10,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {12598#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {12598#true} is VALID [2019-05-15 10:31:10,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {12598#true} #memory_int := #memory_int[main_p1 := 0]; {12609#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:10,221 INFO L273 TraceCheckUtils]: 3: Hoare triple {12609#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12613#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:10,222 INFO L273 TraceCheckUtils]: 4: Hoare triple {12613#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12617#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:10,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {12617#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12621#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:10,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {12621#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12625#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:10,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {12625#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12629#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:10,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {12629#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12633#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:10,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {12633#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12637#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:10,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {12637#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12641#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:10,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {12641#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12645#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:10,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {12645#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12649#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:10,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {12649#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12653#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:10,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {12653#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12657#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:10,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {12657#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12661#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:10,231 INFO L273 TraceCheckUtils]: 16: Hoare triple {12661#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12665#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:10,232 INFO L273 TraceCheckUtils]: 17: Hoare triple {12665#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12669#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:10,232 INFO L273 TraceCheckUtils]: 18: Hoare triple {12669#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12673#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:10,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {12673#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12677#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:10,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {12677#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12681#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:10,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {12681#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12685#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:10,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {12685#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12689#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:10,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {12689#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12693#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:10,237 INFO L273 TraceCheckUtils]: 24: Hoare triple {12693#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12697#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:10,238 INFO L273 TraceCheckUtils]: 25: Hoare triple {12697#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12701#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:10,238 INFO L273 TraceCheckUtils]: 26: Hoare triple {12701#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12705#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:10,239 INFO L273 TraceCheckUtils]: 27: Hoare triple {12705#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12709#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:10,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {12709#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12713#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:10,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {12713#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12717#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:10,241 INFO L273 TraceCheckUtils]: 30: Hoare triple {12717#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12721#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:10,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {12721#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12725#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:10,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {12725#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12729#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:10,244 INFO L273 TraceCheckUtils]: 33: Hoare triple {12729#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12733#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:10,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {12733#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12737#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:10,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {12737#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12741#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:10,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {12741#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12745#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:10,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {12745#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12749#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:10,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {12749#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12753#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:10,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {12753#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12757#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:10,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {12757#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12761#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:10,250 INFO L273 TraceCheckUtils]: 41: Hoare triple {12761#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12765#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:10,250 INFO L273 TraceCheckUtils]: 42: Hoare triple {12765#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12769#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:10,251 INFO L273 TraceCheckUtils]: 43: Hoare triple {12769#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12773#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:10,252 INFO L273 TraceCheckUtils]: 44: Hoare triple {12773#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12777#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:10,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {12777#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12781#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:10,253 INFO L273 TraceCheckUtils]: 46: Hoare triple {12781#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12785#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:10,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {12785#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12789#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:10,255 INFO L273 TraceCheckUtils]: 48: Hoare triple {12789#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12793#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:10,256 INFO L273 TraceCheckUtils]: 49: Hoare triple {12793#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12797#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:10,256 INFO L273 TraceCheckUtils]: 50: Hoare triple {12797#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12801#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:10,257 INFO L273 TraceCheckUtils]: 51: Hoare triple {12801#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12805#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:10,258 INFO L273 TraceCheckUtils]: 52: Hoare triple {12805#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12809#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:10,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {12809#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12813#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:10,259 INFO L273 TraceCheckUtils]: 54: Hoare triple {12813#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {12817#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:10,260 INFO L273 TraceCheckUtils]: 55: Hoare triple {12817#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} assume !(#memory_int[main_p1] >= 0); {12599#false} is VALID [2019-05-15 10:31:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:10,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-15 10:31:10,265 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-05-15 10:31:10,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:10,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2019-05-15 10:31:10,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:10,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-05-15 10:31:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-15 10:31:10,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-05-15 10:31:10,311 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 55 states. [2019-05-15 10:31:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:16,327 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-15 10:31:16,327 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 56 [2019-05-15 10:31:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:31:16,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-05-15 10:31:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-05-15 10:31:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-05-15 10:31:16,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2019-05-15 10:31:16,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:16,392 INFO L225 Difference]: With dead ends: 58 [2019-05-15 10:31:16,392 INFO L226 Difference]: Without dead ends: 58 [2019-05-15 10:31:16,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-05-15 10:31:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-05-15 10:31:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-05-15 10:31:16,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:16,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:16,395 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:16,395 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:16,395 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:16,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:16,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:16,396 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:16,396 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2019-05-15 10:31:16,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:16,397 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-05-15 10:31:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:16,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:16,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:16,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:16,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-05-15 10:31:16,398 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-05-15 10:31:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:16,399 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-05-15 10:31:16,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-05-15 10:31:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-05-15 10:31:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-05-15 10:31:16,399 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:16,399 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-05-15 10:31:16,400 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:16,400 INFO L82 PathProgramCache]: Analyzing trace with hash 474175682, now seen corresponding path program 53 times [2019-05-15 10:31:16,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:16,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-15 10:31:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:16,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:16,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:16,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:16,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1438|]. (= (store |v_#memory_int_1438| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:31:16,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:16,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1439|]. (let ((.cse0 (select |v_#memory_int_1439| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:16,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:16,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1440|]. (let ((.cse0 (select |v_#memory_int_1440| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:31:16,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:16,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,520 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,528 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1441|]. (let ((.cse0 (select |v_#memory_int_1441| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:16,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:16,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1442|]. (let ((.cse0 (select |v_#memory_int_1442| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:31:16,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:16,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,575 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1443|]. (let ((.cse0 (select |v_#memory_int_1443| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1443| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:16,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:16,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1444|]. (let ((.cse0 (select |v_#memory_int_1444| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_1444| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:16,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:16,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,624 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1445|]. (let ((.cse0 (select |v_#memory_int_1445| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_1445| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:16,624 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:16,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1446|]. (let ((.cse0 (select |v_#memory_int_1446| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:31:16,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:16,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1447|]. (let ((.cse0 (select |v_#memory_int_1447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:31:16,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:16,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1448|]. (let ((.cse0 (select |v_#memory_int_1448| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1448| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:16,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:16,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1449|]. (let ((.cse0 (select |v_#memory_int_1449| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1449| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:31:16,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:16,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1450|]. (let ((.cse0 (select |v_#memory_int_1450| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:31:16,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:16,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1451|]. (let ((.cse0 (select |v_#memory_int_1451| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1451| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:16,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:16,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1452|]. (let ((.cse0 (select |v_#memory_int_1452| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:16,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:16,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,862 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1453|]. (let ((.cse0 (select |v_#memory_int_1453| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:16,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:16,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,893 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1454|]. (let ((.cse0 (select |v_#memory_int_1454| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1454| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:31:16,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:16,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1455|]. (let ((.cse0 (select |v_#memory_int_1455| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1455| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:31:16,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:16,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1456|]. (let ((.cse0 (select |v_#memory_int_1456| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1456| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:31:16,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:16,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:16,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:16,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:16,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:16,998 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:16,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1457|]. (let ((.cse0 (select |v_#memory_int_1457| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_1457| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:16,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:17,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1458|]. (let ((.cse0 (select |v_#memory_int_1458| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1458| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:31:17,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:17,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1459|]. (let ((.cse0 (select |v_#memory_int_1459| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1459| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:31:17,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:17,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,107 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1460|]. (let ((.cse0 (select |v_#memory_int_1460| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:31:17,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:17,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1461|]. (let ((.cse0 (select |v_#memory_int_1461| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:31:17,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:17,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1462|]. (let ((.cse0 (select |v_#memory_int_1462| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1462| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:17,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1463|]. (let ((.cse0 (select |v_#memory_int_1463| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_1463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:17,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,261 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1464|]. (let ((.cse0 (select |v_#memory_int_1464| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,261 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:17,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1465|]. (let ((.cse0 (select |v_#memory_int_1465| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1465| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:31:17,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:17,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1466|]. (let ((.cse0 (select |v_#memory_int_1466| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:17,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1467|]. (let ((.cse0 (select |v_#memory_int_1467| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:31:17,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:17,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1468|]. (let ((.cse0 (select |v_#memory_int_1468| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_1468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:17,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1469|]. (let ((.cse0 (select |v_#memory_int_1469| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_1469| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:17,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:17,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1470|]. (let ((.cse0 (select |v_#memory_int_1470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:31:17,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:17,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1471|]. (let ((.cse0 (select |v_#memory_int_1471| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_1471| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:17,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:17,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1472|]. (let ((.cse0 (select |v_#memory_int_1472| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:17,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1473|]. (let ((.cse0 (select |v_#memory_int_1473| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_1473| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:17,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1474|]. (let ((.cse0 (select |v_#memory_int_1474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:31:17,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:17,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1475|]. (let ((.cse0 (select |v_#memory_int_1475| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1475| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:31:17,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:17,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1476|]. (let ((.cse0 (select |v_#memory_int_1476| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1476| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:17,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:17,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1477|]. (let ((.cse0 (select |v_#memory_int_1477| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:17,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:17,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1478|]. (let ((.cse0 (select |v_#memory_int_1478| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:17,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:17,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:17,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:17,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:17,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:17,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1479|]. (let ((.cse0 (select |v_#memory_int_1479| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:17,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:18,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1480|]. (let ((.cse0 (select |v_#memory_int_1480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:18,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:18,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1481|]. (let ((.cse0 (select |v_#memory_int_1481| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_1481| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:18,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:18,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1482|]. (let ((.cse0 (select |v_#memory_int_1482| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_1482| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:18,138 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:18,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1483|]. (let ((.cse0 (select |v_#memory_int_1483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 44 .cse0))) [2019-05-15 10:31:18,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:18,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1484|]. (let ((.cse0 (select |v_#memory_int_1484| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1484| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:31:18,253 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:18,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1485|]. (let ((.cse0 (select |v_#memory_int_1485| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1485| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:31:18,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:18,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1486|]. (let ((.cse0 (select |v_#memory_int_1486| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_1486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:18,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:18,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1487|]. (let ((.cse0 (select |v_#memory_int_1487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:31:18,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:18,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1488|]. (let ((.cse0 (select |v_#memory_int_1488| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_1488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:18,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:18,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1489|]. (let ((.cse0 (select |v_#memory_int_1489| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1489| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:18,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:18,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1490|]. (let ((.cse0 (select |v_#memory_int_1490| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:18,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:18,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:18,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:18,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:18,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:18,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:18,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1491|]. (let ((.cse0 (select |v_#memory_int_1491| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:31:18,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:18,725 INFO L273 TraceCheckUtils]: 0: Hoare triple {13052#true} havoc main_p1; {13052#true} is VALID [2019-05-15 10:31:18,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {13052#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13052#true} is VALID [2019-05-15 10:31:18,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {13052#true} #memory_int := #memory_int[main_p1 := 0]; {13063#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:18,726 INFO L273 TraceCheckUtils]: 3: Hoare triple {13063#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13067#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:18,727 INFO L273 TraceCheckUtils]: 4: Hoare triple {13067#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13071#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:18,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {13071#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13075#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:18,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {13075#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13079#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:18,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {13079#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13083#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:18,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {13083#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13087#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:18,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13091#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:18,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {13091#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13095#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:18,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {13095#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13099#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:18,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {13099#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13103#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:18,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {13103#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13107#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:18,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {13107#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13111#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:18,735 INFO L273 TraceCheckUtils]: 15: Hoare triple {13111#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13115#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:18,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {13115#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13119#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:18,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {13119#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13123#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:18,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {13123#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13127#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:18,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {13127#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13131#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:18,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {13131#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13135#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:18,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {13135#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13139#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:18,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {13139#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13143#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:18,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {13143#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13147#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:18,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {13147#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13151#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:18,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {13151#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13155#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:18,744 INFO L273 TraceCheckUtils]: 26: Hoare triple {13155#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13159#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:18,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {13159#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13163#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:18,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {13163#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13167#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:18,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {13167#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13171#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:18,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {13171#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13175#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:18,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {13175#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13179#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:18,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {13179#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13183#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:18,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {13183#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13187#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:18,750 INFO L273 TraceCheckUtils]: 34: Hoare triple {13187#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13191#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:18,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {13191#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13195#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:18,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {13195#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13199#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:18,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {13199#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13203#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:18,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {13203#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13207#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:18,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {13207#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13211#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:18,755 INFO L273 TraceCheckUtils]: 40: Hoare triple {13211#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13215#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:18,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {13215#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13219#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:18,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {13219#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13223#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:18,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {13223#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13227#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:18,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {13227#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13231#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:18,759 INFO L273 TraceCheckUtils]: 45: Hoare triple {13231#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13235#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:18,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {13235#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13239#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:18,760 INFO L273 TraceCheckUtils]: 47: Hoare triple {13239#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13243#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:18,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {13243#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13247#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:18,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {13247#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13251#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:18,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {13251#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13255#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:18,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {13255#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13259#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:18,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {13259#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13263#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:18,765 INFO L273 TraceCheckUtils]: 53: Hoare triple {13263#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13267#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:18,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {13267#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13271#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:18,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {13271#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13275#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:18,768 INFO L273 TraceCheckUtils]: 56: Hoare triple {13275#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} assume !(#memory_int[main_p1] >= 0); {13053#false} is VALID [2019-05-15 10:31:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:18,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:18,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-15 10:31:18,773 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-05-15 10:31:18,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:18,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2019-05-15 10:31:18,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:18,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-05-15 10:31:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-15 10:31:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:18,822 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 56 states. [2019-05-15 10:31:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:25,128 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-15 10:31:25,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 57 [2019-05-15 10:31:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-05-15 10:31:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-05-15 10:31:25,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2019-05-15 10:31:25,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:25,179 INFO L225 Difference]: With dead ends: 59 [2019-05-15 10:31:25,179 INFO L226 Difference]: Without dead ends: 59 [2019-05-15 10:31:25,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-05-15 10:31:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-05-15 10:31:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-05-15 10:31:25,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:25,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:25,181 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:25,181 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:25,182 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:25,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:25,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:25,182 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:25,183 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2019-05-15 10:31:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:25,183 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-05-15 10:31:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:25,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:25,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:25,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:25,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:31:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-05-15 10:31:25,184 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-05-15 10:31:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:25,184 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-05-15 10:31:25,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-05-15 10:31:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-05-15 10:31:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-05-15 10:31:25,185 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:25,185 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-05-15 10:31:25,185 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1814544200, now seen corresponding path program 54 times [2019-05-15 10:31:25,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:25,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-15 10:31:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:25,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:25,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:25,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:25,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1492|]. (= |#memory_int| (store |v_#memory_int_1492| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:25,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:25,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1493|]. (let ((.cse0 (select |v_#memory_int_1493| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1493| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:31:25,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:25,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1494|]. (let ((.cse0 (select |v_#memory_int_1494| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1494| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:31:25,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:25,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,352 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1495|]. (let ((.cse0 (select |v_#memory_int_1495| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1495| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:31:25,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:25,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1496|]. (let ((.cse0 (select |v_#memory_int_1496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:31:25,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:25,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1497|]. (let ((.cse0 (select |v_#memory_int_1497| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1497| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:31:25,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:25,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1498|]. (let ((.cse0 (select |v_#memory_int_1498| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1498| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:31:25,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:25,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1499|]. (let ((.cse0 (select |v_#memory_int_1499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:31:25,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:25,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1500|]. (let ((.cse0 (select |v_#memory_int_1500| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:25,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1501|]. (let ((.cse0 (select |v_#memory_int_1501| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:31:25,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:25,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1502|]. (let ((.cse0 (select |v_#memory_int_1502| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1502| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:31:25,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:25,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1503|]. (let ((.cse0 (select |v_#memory_int_1503| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_1503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:25,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1504|]. (let ((.cse0 (select |v_#memory_int_1504| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1504| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:25,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1505|]. (let ((.cse0 (select |v_#memory_int_1505| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_1505| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:25,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1506|]. (let ((.cse0 (select |v_#memory_int_1506| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1506| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:31:25,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:25,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1507|]. (let ((.cse0 (select |v_#memory_int_1507| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_1507| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:25,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:25,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1508|]. (let ((.cse0 (select |v_#memory_int_1508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:31:25,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:25,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1509|]. (let ((.cse0 (select |v_#memory_int_1509| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1509| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:31:25,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:25,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1510|]. (let ((.cse0 (select |v_#memory_int_1510| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1510| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:25,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1511|]. (let ((.cse0 (select |v_#memory_int_1511| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1511| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:31:25,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:25,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1512|]. (let ((.cse0 (select |v_#memory_int_1512| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_1512| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:25,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:25,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1513|]. (let ((.cse0 (select |v_#memory_int_1513| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_1513| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:25,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:25,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1514|]. (let ((.cse0 (select |v_#memory_int_1514| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1514| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:25,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:25,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:25,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:25,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:25,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:25,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:25,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1515|]. (let ((.cse0 (select |v_#memory_int_1515| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:31:25,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:26,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1516|]. (let ((.cse0 (select |v_#memory_int_1516| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1516| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:26,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:26,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1517|]. (let ((.cse0 (select |v_#memory_int_1517| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:26,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:26,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1518|]. (let ((.cse0 (select |v_#memory_int_1518| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:26,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:26,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1519|]. (let ((.cse0 (select |v_#memory_int_1519| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:31:26,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:26,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1520|]. (let ((.cse0 (select |v_#memory_int_1520| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1520| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:31:26,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:26,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1521|]. (let ((.cse0 (select |v_#memory_int_1521| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1521| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:26,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:26,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1522|]. (let ((.cse0 (select |v_#memory_int_1522| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_1522| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:26,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:26,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1523|]. (let ((.cse0 (select |v_#memory_int_1523| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:31:26,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:26,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1524|]. (let ((.cse0 (select |v_#memory_int_1524| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_1524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:26,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:26,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,664 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,665 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1525|]. (let ((.cse0 (select |v_#memory_int_1525| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:26,665 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:26,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1526|]. (let ((.cse0 (select |v_#memory_int_1526| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:31:26,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:26,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1527|]. (let ((.cse0 (select |v_#memory_int_1527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:26,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:26,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1528|]. (let ((.cse0 (select |v_#memory_int_1528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:31:26,817 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:26,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1529|]. (let ((.cse0 (select |v_#memory_int_1529| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1529| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:31:26,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:26,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1530|]. (let ((.cse0 (select |v_#memory_int_1530| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1530| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:31:26,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:26,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:26,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:26,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:26,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:26,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:26,997 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1531|]. (let ((.cse0 (select |v_#memory_int_1531| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1531| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 38))) [2019-05-15 10:31:26,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:27,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1532|]. (let ((.cse0 (select |v_#memory_int_1532| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1532| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 39))) [2019-05-15 10:31:27,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:27,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1533|]. (let ((.cse0 (select |v_#memory_int_1533| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:27,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,164 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1534|]. (let ((.cse0 (select |v_#memory_int_1534| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:27,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1535|]. (let ((.cse0 (select |v_#memory_int_1535| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1535| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:31:27,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:27,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1536|]. (let ((.cse0 (select |v_#memory_int_1536| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1536| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:27,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1537|]. (let ((.cse0 (select |v_#memory_int_1537| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_1537| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:27,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:27,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1538|]. (let ((.cse0 (select |v_#memory_int_1538| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:31:27,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:27,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1539|]. (let ((.cse0 (select |v_#memory_int_1539| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:27,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1540|]. (let ((.cse0 (select |v_#memory_int_1540| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1540| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 47 .cse0))) [2019-05-15 10:31:27,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:27,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,574 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,575 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1541|]. (let ((.cse0 (select |v_#memory_int_1541| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,575 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:27,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1542|]. (let ((.cse0 (select |v_#memory_int_1542| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_1542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:27,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1543|]. (let ((.cse0 (select |v_#memory_int_1543| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:31:27,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:27,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1544|]. (let ((.cse0 (select |v_#memory_int_1544| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:27,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1545|]. (let ((.cse0 (select |v_#memory_int_1545| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1545| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 52))) [2019-05-15 10:31:27,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:27,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:27,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:27,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:27,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:27,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:27,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1546|]. (let ((.cse0 (select |v_#memory_int_1546| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_1546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:27,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:27,943 INFO L273 TraceCheckUtils]: 0: Hoare triple {13514#true} havoc main_p1; {13514#true} is VALID [2019-05-15 10:31:27,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {13514#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13514#true} is VALID [2019-05-15 10:31:27,944 INFO L273 TraceCheckUtils]: 2: Hoare triple {13514#true} #memory_int := #memory_int[main_p1 := 0]; {13525#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:27,945 INFO L273 TraceCheckUtils]: 3: Hoare triple {13525#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13529#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:27,946 INFO L273 TraceCheckUtils]: 4: Hoare triple {13529#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13533#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:27,946 INFO L273 TraceCheckUtils]: 5: Hoare triple {13533#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13537#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:27,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {13537#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13541#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:27,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {13541#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13545#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:27,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {13545#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13549#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:27,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {13549#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13553#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:27,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {13553#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13557#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:27,951 INFO L273 TraceCheckUtils]: 11: Hoare triple {13557#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13561#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:27,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {13561#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13565#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:27,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {13565#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13569#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:27,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {13569#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13573#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:27,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {13573#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13577#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:27,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {13577#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13581#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:27,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {13581#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13585#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:27,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {13585#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13589#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:27,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {13589#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13593#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:27,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {13593#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13597#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:27,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {13597#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13601#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:27,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {13601#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13605#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:27,960 INFO L273 TraceCheckUtils]: 23: Hoare triple {13605#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13609#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:27,961 INFO L273 TraceCheckUtils]: 24: Hoare triple {13609#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13613#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:27,962 INFO L273 TraceCheckUtils]: 25: Hoare triple {13613#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13617#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:27,962 INFO L273 TraceCheckUtils]: 26: Hoare triple {13617#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13621#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:27,963 INFO L273 TraceCheckUtils]: 27: Hoare triple {13621#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13625#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:27,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {13625#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13629#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:27,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {13629#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13633#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:27,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {13633#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13637#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:27,966 INFO L273 TraceCheckUtils]: 31: Hoare triple {13637#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13641#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:27,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {13641#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13645#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:27,968 INFO L273 TraceCheckUtils]: 33: Hoare triple {13645#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13649#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:27,968 INFO L273 TraceCheckUtils]: 34: Hoare triple {13649#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13653#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:27,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {13653#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13657#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:27,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {13657#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13661#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:27,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {13661#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13665#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:27,971 INFO L273 TraceCheckUtils]: 38: Hoare triple {13665#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13669#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:27,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {13669#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13673#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:27,973 INFO L273 TraceCheckUtils]: 40: Hoare triple {13673#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13677#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:27,974 INFO L273 TraceCheckUtils]: 41: Hoare triple {13677#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13681#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:27,974 INFO L273 TraceCheckUtils]: 42: Hoare triple {13681#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13685#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:27,975 INFO L273 TraceCheckUtils]: 43: Hoare triple {13685#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13689#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:27,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {13689#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13693#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:27,977 INFO L273 TraceCheckUtils]: 45: Hoare triple {13693#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13697#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:27,978 INFO L273 TraceCheckUtils]: 46: Hoare triple {13697#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13701#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:27,978 INFO L273 TraceCheckUtils]: 47: Hoare triple {13701#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13705#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:27,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {13705#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13709#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:27,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {13709#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13713#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:27,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {13713#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13717#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:27,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {13717#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13721#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:27,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {13721#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13725#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:27,983 INFO L273 TraceCheckUtils]: 53: Hoare triple {13725#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13729#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:27,984 INFO L273 TraceCheckUtils]: 54: Hoare triple {13729#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13733#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:27,984 INFO L273 TraceCheckUtils]: 55: Hoare triple {13733#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13737#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:27,985 INFO L273 TraceCheckUtils]: 56: Hoare triple {13737#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13741#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:27,986 INFO L273 TraceCheckUtils]: 57: Hoare triple {13741#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} assume !(#memory_int[main_p1] >= 0); {13515#false} is VALID [2019-05-15 10:31:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:27,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:27,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-15 10:31:27,992 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-05-15 10:31:27,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:27,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2019-05-15 10:31:28,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:28,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-05-15 10:31:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-15 10:31:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-05-15 10:31:28,037 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 57 states. [2019-05-15 10:31:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:34,455 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:34,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-15 10:31:34,455 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2019-05-15 10:31:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:34,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-05-15 10:31:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-05-15 10:31:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-05-15 10:31:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2019-05-15 10:31:34,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:34,506 INFO L225 Difference]: With dead ends: 60 [2019-05-15 10:31:34,506 INFO L226 Difference]: Without dead ends: 60 [2019-05-15 10:31:34,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-05-15 10:31:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-05-15 10:31:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-05-15 10:31:34,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:34,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:34,508 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:34,508 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:34,509 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:34,509 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:34,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:34,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:34,510 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:34,510 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2019-05-15 10:31:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:34,510 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-05-15 10:31:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:34,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:34,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:34,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:34,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:31:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-05-15 10:31:34,512 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-05-15 10:31:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:34,512 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-05-15 10:31:34,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-05-15 10:31:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-05-15 10:31:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-05-15 10:31:34,513 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:34,513 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-05-15 10:31:34,513 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:34,513 INFO L82 PathProgramCache]: Analyzing trace with hash 416295298, now seen corresponding path program 55 times [2019-05-15 10:31:34,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:34,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-15 10:31:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:34,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:34,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:34,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:34,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1547|]. (= |#memory_int| (store |v_#memory_int_1547| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:34,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:34,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1548|]. (let ((.cse0 (select |v_#memory_int_1548| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1548| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:34,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1549|]. (let ((.cse0 (select |v_#memory_int_1549| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1549| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:31:34,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:34,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1550|]. (let ((.cse0 (select |v_#memory_int_1550| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1550| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:31:34,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:34,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1551|]. (let ((.cse0 (select |v_#memory_int_1551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:31:34,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:34,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1552|]. (let ((.cse0 (select |v_#memory_int_1552| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_1552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:34,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:34,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1553|]. (let ((.cse0 (select |v_#memory_int_1553| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:31:34,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:34,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1554|]. (let ((.cse0 (select |v_#memory_int_1554| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1554| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:34,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:34,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:34,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:34,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:34,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:34,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:34,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1555|]. (let ((.cse0 (select |v_#memory_int_1555| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1555| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:31:34,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:35,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1556|]. (let ((.cse0 (select |v_#memory_int_1556| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:35,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,085 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1557|]. (let ((.cse0 (select |v_#memory_int_1557| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1557| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:31:35,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:35,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1558|]. (let ((.cse0 (select |v_#memory_int_1558| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:35,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:35,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1559|]. (let ((.cse0 (select |v_#memory_int_1559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:31:35,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:35,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,171 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1560|]. (let ((.cse0 (select |v_#memory_int_1560| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1560| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:31:35,171 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:35,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1561|]. (let ((.cse0 (select |v_#memory_int_1561| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1561| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:31:35,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:35,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1562|]. (let ((.cse0 (select |v_#memory_int_1562| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:35,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:35,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,264 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1563|]. (let ((.cse0 (select |v_#memory_int_1563| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1563| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:31:35,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:35,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1564|]. (let ((.cse0 (select |v_#memory_int_1564| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_1564| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:35,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:35,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,329 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,329 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1565|]. (let ((.cse0 (select |v_#memory_int_1565| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1565| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:31:35,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:35,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1566|]. (let ((.cse0 (select |v_#memory_int_1566| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1566| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:31:35,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:35,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1567|]. (let ((.cse0 (select |v_#memory_int_1567| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:31:35,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:35,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1568|]. (let ((.cse0 (select |v_#memory_int_1568| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1568| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:31:35,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:35,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1569|]. (let ((.cse0 (select |v_#memory_int_1569| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:31:35,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:35,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1570|]. (let ((.cse0 (select |v_#memory_int_1570| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:35,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1571|]. (let ((.cse0 (select |v_#memory_int_1571| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:35,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1572|]. (let ((.cse0 (select |v_#memory_int_1572| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:31:35,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:35,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1573|]. (let ((.cse0 (select |v_#memory_int_1573| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1573| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:31:35,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:35,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1574|]. (let ((.cse0 (select |v_#memory_int_1574| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:31:35,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:35,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1575|]. (let ((.cse0 (select |v_#memory_int_1575| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_1575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:35,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1576|]. (let ((.cse0 (select |v_#memory_int_1576| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:31:35,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:35,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1577|]. (let ((.cse0 (select |v_#memory_int_1577| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1577| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:31:35,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:35,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1578|]. (let ((.cse0 (select |v_#memory_int_1578| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:35,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1579|]. (let ((.cse0 (select |v_#memory_int_1579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:31:35,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:35,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1580|]. (let ((.cse0 (select |v_#memory_int_1580| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:31:35,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:35,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:35,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:35,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:35,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:35,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:35,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1581|]. (let ((.cse0 (select |v_#memory_int_1581| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:35,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:36,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1582|]. (let ((.cse0 (select |v_#memory_int_1582| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:36,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:36,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1583|]. (let ((.cse0 (select |v_#memory_int_1583| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1583| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:36,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,133 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1584|]. (let ((.cse0 (select |v_#memory_int_1584| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:31:36,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:36,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1585|]. (let ((.cse0 (select |v_#memory_int_1585| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:36,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1586|]. (let ((.cse0 (select |v_#memory_int_1586| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:31:36,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:36,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1587|]. (let ((.cse0 (select |v_#memory_int_1587| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_1587| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:36,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1588|]. (let ((.cse0 (select |v_#memory_int_1588| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_1588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:36,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1589|]. (let ((.cse0 (select |v_#memory_int_1589| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_1589| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:36,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:36,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,714 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1590|]. (let ((.cse0 (select |v_#memory_int_1590| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_1590| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:36,714 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:36,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1591|]. (let ((.cse0 (select |v_#memory_int_1591| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_1591| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:36,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1592|]. (let ((.cse0 (select |v_#memory_int_1592| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:31:36,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:36,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1593|]. (let ((.cse0 (select |v_#memory_int_1593| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_1593| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:36,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:36,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1594|]. (let ((.cse0 (select |v_#memory_int_1594| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1594| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:31:36,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:36,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:36,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:36,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:36,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:36,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:36,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1595|]. (let ((.cse0 (select |v_#memory_int_1595| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:36,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:37,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1596|]. (let ((.cse0 (select |v_#memory_int_1596| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:37,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:37,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1597|]. (let ((.cse0 (select |v_#memory_int_1597| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:31:37,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:37,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1598|]. (let ((.cse0 (select |v_#memory_int_1598| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:31:37,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:37,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1599|]. (let ((.cse0 (select |v_#memory_int_1599| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1599| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:31:37,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:37,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1600|]. (let ((.cse0 (select |v_#memory_int_1600| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_1600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:37,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:37,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1601|]. (let ((.cse0 (select |v_#memory_int_1601| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1601| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:31:37,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:37,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:37,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:37,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:37,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:37,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:37,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1602|]. (let ((.cse0 (select |v_#memory_int_1602| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1602| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:31:37,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:31:37,470 INFO L273 TraceCheckUtils]: 0: Hoare triple {13984#true} havoc main_p1; {13984#true} is VALID [2019-05-15 10:31:37,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {13984#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {13984#true} is VALID [2019-05-15 10:31:37,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {13984#true} #memory_int := #memory_int[main_p1 := 0]; {13995#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:37,472 INFO L273 TraceCheckUtils]: 3: Hoare triple {13995#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {13999#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:37,473 INFO L273 TraceCheckUtils]: 4: Hoare triple {13999#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14003#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:37,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {14003#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14007#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:37,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {14007#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14011#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:37,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {14011#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14015#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:37,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {14015#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14019#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:37,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {14019#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14023#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:37,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {14023#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14027#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:37,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {14027#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14031#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:37,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {14031#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14035#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:37,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {14035#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14039#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:37,481 INFO L273 TraceCheckUtils]: 14: Hoare triple {14039#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14043#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:37,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {14043#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14047#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:37,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {14047#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14051#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:37,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {14051#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14055#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:37,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {14055#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14059#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:37,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {14059#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14063#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:37,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {14063#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14067#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:37,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {14067#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14071#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:37,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {14071#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14075#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:37,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {14075#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14079#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:37,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {14079#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14083#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:37,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {14083#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14087#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:37,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {14087#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14091#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:37,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {14091#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14095#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:37,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {14095#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14099#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:37,493 INFO L273 TraceCheckUtils]: 29: Hoare triple {14099#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14103#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:37,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {14103#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14107#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:37,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {14107#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14111#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:37,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {14111#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14115#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:37,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {14115#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14119#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:37,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {14119#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14123#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:37,498 INFO L273 TraceCheckUtils]: 35: Hoare triple {14123#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14127#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:37,499 INFO L273 TraceCheckUtils]: 36: Hoare triple {14127#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14131#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:37,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {14131#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14135#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:37,500 INFO L273 TraceCheckUtils]: 38: Hoare triple {14135#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14139#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:37,501 INFO L273 TraceCheckUtils]: 39: Hoare triple {14139#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14143#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:37,502 INFO L273 TraceCheckUtils]: 40: Hoare triple {14143#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14147#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:37,503 INFO L273 TraceCheckUtils]: 41: Hoare triple {14147#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14151#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:37,504 INFO L273 TraceCheckUtils]: 42: Hoare triple {14151#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14155#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:37,504 INFO L273 TraceCheckUtils]: 43: Hoare triple {14155#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14159#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:37,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {14159#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14163#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:37,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {14163#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14167#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:37,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {14167#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14171#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:37,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {14171#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14175#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:37,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {14175#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14179#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:37,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {14179#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14183#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:37,510 INFO L273 TraceCheckUtils]: 50: Hoare triple {14183#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14187#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:37,511 INFO L273 TraceCheckUtils]: 51: Hoare triple {14187#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14191#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:37,512 INFO L273 TraceCheckUtils]: 52: Hoare triple {14191#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14195#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:37,512 INFO L273 TraceCheckUtils]: 53: Hoare triple {14195#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14199#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:37,513 INFO L273 TraceCheckUtils]: 54: Hoare triple {14199#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14203#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:37,514 INFO L273 TraceCheckUtils]: 55: Hoare triple {14203#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14207#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:37,515 INFO L273 TraceCheckUtils]: 56: Hoare triple {14207#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14211#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:37,516 INFO L273 TraceCheckUtils]: 57: Hoare triple {14211#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14215#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:31:37,516 INFO L273 TraceCheckUtils]: 58: Hoare triple {14215#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} assume !(#memory_int[main_p1] >= 0); {13985#false} is VALID [2019-05-15 10:31:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:37,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-15 10:31:37,523 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-05-15 10:31:37,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:37,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2019-05-15 10:31:37,571 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:37,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-05-15 10:31:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-15 10:31:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:31:37,573 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 58 states. [2019-05-15 10:31:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:44,234 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-15 10:31:44,235 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 59 [2019-05-15 10:31:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:31:44,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-05-15 10:31:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-05-15 10:31:44,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2019-05-15 10:31:44,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:44,285 INFO L225 Difference]: With dead ends: 61 [2019-05-15 10:31:44,285 INFO L226 Difference]: Without dead ends: 61 [2019-05-15 10:31:44,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-05-15 10:31:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-05-15 10:31:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-05-15 10:31:44,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:44,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:44,287 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:44,288 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:44,289 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:44,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:44,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:44,290 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:44,290 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2019-05-15 10:31:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:44,290 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-05-15 10:31:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:44,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:44,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:44,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:44,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:31:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-05-15 10:31:44,292 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-05-15 10:31:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:44,292 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-05-15 10:31:44,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-05-15 10:31:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-05-15 10:31:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-05-15 10:31:44,293 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:44,293 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-05-15 10:31:44,293 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash 20252296, now seen corresponding path program 56 times [2019-05-15 10:31:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:44,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-15 10:31:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:44,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:44,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:44,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:44,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1603|]. (= |#memory_int| (store |v_#memory_int_1603| ULTIMATE.start_main_p1 0)) [2019-05-15 10:31:44,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:44,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1604|]. (let ((.cse0 (select |v_#memory_int_1604| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:31:44,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:44,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1605|]. (let ((.cse0 (select |v_#memory_int_1605| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:44,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1606|]. (let ((.cse0 (select |v_#memory_int_1606| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_1606| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:44,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:44,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1607|]. (let ((.cse0 (select |v_#memory_int_1607| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:31:44,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:44,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,484 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,484 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1608|]. (let ((.cse0 (select |v_#memory_int_1608| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:31:44,484 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:44,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,509 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,510 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1609|]. (let ((.cse0 (select |v_#memory_int_1609| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_1609| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:44,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:44,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1610|]. (let ((.cse0 (select |v_#memory_int_1610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:31:44,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:44,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1611|]. (let ((.cse0 (select |v_#memory_int_1611| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_1611| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:44,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:44,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1612|]. (let ((.cse0 (select |v_#memory_int_1612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:31:44,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:44,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1613|]. (let ((.cse0 (select |v_#memory_int_1613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:31:44,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:44,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1614|]. (let ((.cse0 (select |v_#memory_int_1614| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:44,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1615|]. (let ((.cse0 (select |v_#memory_int_1615| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:31:44,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:44,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1616|]. (let ((.cse0 (select |v_#memory_int_1616| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1616| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:44,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:44,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1617|]. (let ((.cse0 (select |v_#memory_int_1617| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:44,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1618|]. (let ((.cse0 (select |v_#memory_int_1618| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:44,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:44,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,810 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1619|]. (let ((.cse0 (select |v_#memory_int_1619| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1619| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:31:44,810 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:44,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1620|]. (let ((.cse0 (select |v_#memory_int_1620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:31:44,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:44,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1621|]. (let ((.cse0 (select |v_#memory_int_1621| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_1621| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:44,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:44,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1622|]. (let ((.cse0 (select |v_#memory_int_1622| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1622| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:31:44,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:44,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:44,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:44,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1623|]. (let ((.cse0 (select |v_#memory_int_1623| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_1623| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:44,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:44,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:44,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:44,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:44,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1624|]. (let ((.cse0 (select |v_#memory_int_1624| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:45,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:45,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1625|]. (let ((.cse0 (select |v_#memory_int_1625| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_1625| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:45,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:45,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1626|]. (let ((.cse0 (select |v_#memory_int_1626| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1626| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:31:45,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:45,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1627|]. (let ((.cse0 (select |v_#memory_int_1627| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:31:45,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:45,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1628|]. (let ((.cse0 (select |v_#memory_int_1628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:31:45,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:45,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1629|]. (let ((.cse0 (select |v_#memory_int_1629| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:31:45,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:45,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1630|]. (let ((.cse0 (select |v_#memory_int_1630| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1630| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:31:45,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:45,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1631|]. (let ((.cse0 (select |v_#memory_int_1631| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:31:45,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:45,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,316 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,316 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1632|]. (let ((.cse0 (select |v_#memory_int_1632| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:31:45,316 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:45,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1633|]. (let ((.cse0 (select |v_#memory_int_1633| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1633| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:31:45,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:45,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1634|]. (let ((.cse0 (select |v_#memory_int_1634| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:31:45,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:45,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1635|]. (let ((.cse0 (select |v_#memory_int_1635| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_1635| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:45,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:45,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1636|]. (let ((.cse0 (select |v_#memory_int_1636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:31:45,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:45,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,547 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1637|]. (let ((.cse0 (select |v_#memory_int_1637| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:31:45,547 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:45,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1638|]. (let ((.cse0 (select |v_#memory_int_1638| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1638| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:45,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:45,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,645 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1639|]. (let ((.cse0 (select |v_#memory_int_1639| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:31:45,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:45,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1640|]. (let ((.cse0 (select |v_#memory_int_1640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:31:45,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:45,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1641|]. (let ((.cse0 (select |v_#memory_int_1641| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_1641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:45,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:45,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1642|]. (let ((.cse0 (select |v_#memory_int_1642| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:31:45,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:45,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1643|]. (let ((.cse0 (select |v_#memory_int_1643| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= |#memory_int| (store |v_#memory_int_1643| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:45,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:45,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,906 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1644|]. (let ((.cse0 (select |v_#memory_int_1644| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_1644| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:45,906 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:45,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:45,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:45,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:45,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:45,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:45,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1645|]. (let ((.cse0 (select |v_#memory_int_1645| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:31:45,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:46,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1646|]. (let ((.cse0 (select |v_#memory_int_1646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:31:46,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:46,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1647|]. (let ((.cse0 (select |v_#memory_int_1647| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1647| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:31:46,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:46,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1648|]. (let ((.cse0 (select |v_#memory_int_1648| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_1648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:46,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1649|]. (let ((.cse0 (select |v_#memory_int_1649| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,187 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:46,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1650|]. (let ((.cse0 (select |v_#memory_int_1650| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1650| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:46,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1651|]. (let ((.cse0 (select |v_#memory_int_1651| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1651| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:46,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1652|]. (let ((.cse0 (select |v_#memory_int_1652| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_1652| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:46,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1653|]. (let ((.cse0 (select |v_#memory_int_1653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:31:46,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:46,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1654|]. (let ((.cse0 (select |v_#memory_int_1654| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_1654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:46,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,684 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1655|]. (let ((.cse0 (select |v_#memory_int_1655| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:46,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1656|]. (let ((.cse0 (select |v_#memory_int_1656| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_1656| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:46,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:46,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1657|]. (let ((.cse0 (select |v_#memory_int_1657| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_1657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:46,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:46,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:46,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:46,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:46,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:46,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:46,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1658|]. (let ((.cse0 (select |v_#memory_int_1658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:31:46,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:31:47,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:47,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:47,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:47,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:47,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:47,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:47,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1659|]. (let ((.cse0 (select |v_#memory_int_1659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:31:47,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:31:47,073 INFO L273 TraceCheckUtils]: 0: Hoare triple {14462#true} havoc main_p1; {14462#true} is VALID [2019-05-15 10:31:47,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {14462#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {14462#true} is VALID [2019-05-15 10:31:47,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {14462#true} #memory_int := #memory_int[main_p1 := 0]; {14473#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:47,075 INFO L273 TraceCheckUtils]: 3: Hoare triple {14473#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14477#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:47,076 INFO L273 TraceCheckUtils]: 4: Hoare triple {14477#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14481#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:47,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {14481#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14485#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:47,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {14485#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14489#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:47,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {14489#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14493#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:47,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {14493#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14497#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:47,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {14497#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14501#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:47,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {14501#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14505#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:47,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {14505#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14509#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:47,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {14509#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14513#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:47,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {14513#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14517#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:47,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {14517#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14521#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:47,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {14521#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14525#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:47,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {14525#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14529#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:47,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {14529#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14533#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:47,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {14533#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14537#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:47,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {14537#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14541#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:47,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {14541#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14545#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:47,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {14545#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14549#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:47,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {14549#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14553#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:47,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {14553#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14557#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:47,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {14557#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14561#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:47,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {14561#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14565#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:47,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {14565#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14569#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:47,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {14569#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14573#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:47,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {14573#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14577#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:47,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {14577#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14581#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:47,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {14581#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14585#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:47,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {14585#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14589#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:47,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {14589#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14593#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:47,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {14593#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14597#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:47,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {14597#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14601#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:47,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {14601#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14605#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:47,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {14605#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14609#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:47,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {14609#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14613#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:47,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {14613#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14617#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:47,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {14617#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14621#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:47,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {14621#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14625#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:47,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {14625#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14629#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:47,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {14629#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14633#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:47,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {14633#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14637#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:47,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {14637#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14641#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:47,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {14641#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14645#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:47,106 INFO L273 TraceCheckUtils]: 46: Hoare triple {14645#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14649#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:47,107 INFO L273 TraceCheckUtils]: 47: Hoare triple {14649#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14653#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:47,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {14653#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14657#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:47,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {14657#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14661#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:47,109 INFO L273 TraceCheckUtils]: 50: Hoare triple {14661#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14665#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:47,110 INFO L273 TraceCheckUtils]: 51: Hoare triple {14665#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14669#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:47,111 INFO L273 TraceCheckUtils]: 52: Hoare triple {14669#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14673#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:47,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {14673#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14677#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:47,112 INFO L273 TraceCheckUtils]: 54: Hoare triple {14677#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14681#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:47,113 INFO L273 TraceCheckUtils]: 55: Hoare triple {14681#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14685#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:47,114 INFO L273 TraceCheckUtils]: 56: Hoare triple {14685#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14689#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:47,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {14689#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14693#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:31:47,115 INFO L273 TraceCheckUtils]: 58: Hoare triple {14693#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14697#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:31:47,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {14697#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} assume !(#memory_int[main_p1] >= 0); {14463#false} is VALID [2019-05-15 10:31:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:47,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:47,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-15 10:31:47,122 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-05-15 10:31:47,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:47,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2019-05-15 10:31:47,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:47,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-05-15 10:31:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-15 10:31:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-05-15 10:31:47,169 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-05-15 10:31:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:54,062 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:31:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-15 10:31:54,062 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-05-15 10:31:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:31:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:31:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-05-15 10:31:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-05-15 10:31:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-05-15 10:31:54,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 63 transitions. [2019-05-15 10:31:54,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:54,192 INFO L225 Difference]: With dead ends: 62 [2019-05-15 10:31:54,192 INFO L226 Difference]: Without dead ends: 62 [2019-05-15 10:31:54,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-05-15 10:31:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-05-15 10:31:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-05-15 10:31:54,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:31:54,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2019-05-15 10:31:54,195 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2019-05-15 10:31:54,195 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2019-05-15 10:31:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:54,196 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:31:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:31:54,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:54,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:54,196 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2019-05-15 10:31:54,196 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2019-05-15 10:31:54,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:31:54,197 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-05-15 10:31:54,197 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:31:54,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:31:54,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:31:54,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:31:54,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:31:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:31:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-05-15 10:31:54,199 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-05-15 10:31:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:31:54,199 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-05-15 10:31:54,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-05-15 10:31:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-05-15 10:31:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-05-15 10:31:54,200 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:31:54,200 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-05-15 10:31:54,200 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:31:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:31:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash 627821122, now seen corresponding path program 57 times [2019-05-15 10:31:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:31:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:54,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-15 10:31:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:31:54,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:31:54,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:31:54,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:31:54,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1660|]. (= (store |v_#memory_int_1660| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:31:54,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:31:54,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1661|]. (let ((.cse0 (select |v_#memory_int_1661| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1661| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:31:54,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:31:54,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1662|]. (let ((.cse0 (select |v_#memory_int_1662| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:31:54,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:31:54,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1663|]. (let ((.cse0 (select |v_#memory_int_1663| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_1663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:31:54,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,490 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,490 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1664|]. (let ((.cse0 (select |v_#memory_int_1664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:31:54,490 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:31:54,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,509 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1665|]. (let ((.cse0 (select |v_#memory_int_1665| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1665| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:31:54,510 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:31:54,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1666|]. (let ((.cse0 (select |v_#memory_int_1666| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_1666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:31:54,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1667|]. (let ((.cse0 (select |v_#memory_int_1667| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_1667| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:54,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:31:54,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1668|]. (let ((.cse0 (select |v_#memory_int_1668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:31:54,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:31:54,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1669|]. (let ((.cse0 (select |v_#memory_int_1669| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_1669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:54,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:31:54,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1670|]. (let ((.cse0 (select |v_#memory_int_1670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:31:54,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:31:54,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:54,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:54,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:54,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:54,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:54,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1671|]. (let ((.cse0 (select |v_#memory_int_1671| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:31:54,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:31:55,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1672|]. (let ((.cse0 (select |v_#memory_int_1672| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:31:55,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:31:55,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1673|]. (let ((.cse0 (select |v_#memory_int_1673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:31:55,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:31:55,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1674|]. (let ((.cse0 (select |v_#memory_int_1674| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1674| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:31:55,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:31:55,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1675|]. (let ((.cse0 (select |v_#memory_int_1675| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:31:55,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:31:55,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1676|]. (let ((.cse0 (select |v_#memory_int_1676| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:31:55,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:31:55,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1677|]. (let ((.cse0 (select |v_#memory_int_1677| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_1677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:31:55,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1678|]. (let ((.cse0 (select |v_#memory_int_1678| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:31:55,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1679|]. (let ((.cse0 (select |v_#memory_int_1679| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1679| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,253 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:31:55,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1680|]. (let ((.cse0 (select |v_#memory_int_1680| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1680| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:31:55,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:31:55,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1681|]. (let ((.cse0 (select |v_#memory_int_1681| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:31:55,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1682|]. (let ((.cse0 (select |v_#memory_int_1682| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:31:55,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1683|]. (let ((.cse0 (select |v_#memory_int_1683| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1683| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:31:55,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1684|]. (let ((.cse0 (select |v_#memory_int_1684| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:31:55,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:31:55,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,478 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1685|]. (let ((.cse0 (select |v_#memory_int_1685| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:31:55,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,517 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,517 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1686|]. (let ((.cse0 (select |v_#memory_int_1686| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:31:55,517 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:31:55,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1687|]. (let ((.cse0 (select |v_#memory_int_1687| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_1687| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:31:55,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,599 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1688|]. (let ((.cse0 (select |v_#memory_int_1688| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1688| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:31:55,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:31:55,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1689|]. (let ((.cse0 (select |v_#memory_int_1689| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1689| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:31:55,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,677 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,685 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,685 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1690|]. (let ((.cse0 (select |v_#memory_int_1690| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1690| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:31:55,685 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:31:55,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1691|]. (let ((.cse0 (select |v_#memory_int_1691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:31:55,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:31:55,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1692|]. (let ((.cse0 (select |v_#memory_int_1692| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_1692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:55,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:31:55,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1693|]. (let ((.cse0 (select |v_#memory_int_1693| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:31:55,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:31:55,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1694|]. (let ((.cse0 (select |v_#memory_int_1694| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1694| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 33 .cse0))) [2019-05-15 10:31:55,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:31:55,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1695|]. (let ((.cse0 (select |v_#memory_int_1695| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:31:55,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:31:55,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:55,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:55,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:55,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:55,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:55,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1696|]. (let ((.cse0 (select |v_#memory_int_1696| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:31:55,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:31:56,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1697|]. (let ((.cse0 (select |v_#memory_int_1697| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:31:56,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:31:56,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1698|]. (let ((.cse0 (select |v_#memory_int_1698| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_1698| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:31:56,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1699|]. (let ((.cse0 (select |v_#memory_int_1699| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:31:56,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1700|]. (let ((.cse0 (select |v_#memory_int_1700| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:31:56,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1701|]. (let ((.cse0 (select |v_#memory_int_1701| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:31:56,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:31:56,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1702|]. (let ((.cse0 (select |v_#memory_int_1702| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:31:56,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1703|]. (let ((.cse0 (select |v_#memory_int_1703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:31:56,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:31:56,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1704|]. (let ((.cse0 (select |v_#memory_int_1704| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:31:56,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1705|]. (let ((.cse0 (select |v_#memory_int_1705| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_1705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:56,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:31:56,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1706|]. (let ((.cse0 (select |v_#memory_int_1706| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:56,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:31:56,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1707|]. (let ((.cse0 (select |v_#memory_int_1707| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1707| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:31:56,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:31:56,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1708|]. (let ((.cse0 (select |v_#memory_int_1708| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1708| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:31:56,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:31:56,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1709|]. (let ((.cse0 (select |v_#memory_int_1709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:31:56,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:31:56,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1710|]. (let ((.cse0 (select |v_#memory_int_1710| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_1710| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:56,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:31:56,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:56,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:56,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:56,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:56,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:56,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1711|]. (let ((.cse0 (select |v_#memory_int_1711| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_1711| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:56,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:31:57,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1712|]. (let ((.cse0 (select |v_#memory_int_1712| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_1712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:57,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:31:57,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1713|]. (let ((.cse0 (select |v_#memory_int_1713| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_1713| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:31:57,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:31:57,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1714|]. (let ((.cse0 (select |v_#memory_int_1714| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:31:57,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:31:57,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1715|]. (let ((.cse0 (select |v_#memory_int_1715| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_1715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:57,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:31:57,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1716|]. (let ((.cse0 (select |v_#memory_int_1716| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_1716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:31:57,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:31:57,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:31:57,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:31:57,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:31:57,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:31:57,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:31:57,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1717|]. (let ((.cse0 (select |v_#memory_int_1717| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:31:57,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:31:57,413 INFO L273 TraceCheckUtils]: 0: Hoare triple {14948#true} havoc main_p1; {14948#true} is VALID [2019-05-15 10:31:57,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {14948#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {14948#true} is VALID [2019-05-15 10:31:57,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {14948#true} #memory_int := #memory_int[main_p1 := 0]; {14959#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:31:57,415 INFO L273 TraceCheckUtils]: 3: Hoare triple {14959#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14963#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:31:57,415 INFO L273 TraceCheckUtils]: 4: Hoare triple {14963#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14967#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:31:57,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {14967#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14971#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:31:57,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {14971#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14975#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:31:57,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {14975#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14979#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:31:57,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {14979#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14983#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:31:57,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {14983#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14987#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:31:57,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {14987#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14991#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:31:57,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {14991#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14995#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:31:57,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {14995#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {14999#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:31:57,421 INFO L273 TraceCheckUtils]: 13: Hoare triple {14999#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15003#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:31:57,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {15003#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15007#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:31:57,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {15007#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15011#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:31:57,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {15011#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15015#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:31:57,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {15015#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15019#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:31:57,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {15019#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15023#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:31:57,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {15023#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15027#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:31:57,427 INFO L273 TraceCheckUtils]: 20: Hoare triple {15027#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15031#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:31:57,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {15031#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15035#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:31:57,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {15035#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15039#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:31:57,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {15039#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15043#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:31:57,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {15043#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15047#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:31:57,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {15047#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15051#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:31:57,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {15051#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15055#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:31:57,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {15055#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15059#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:31:57,433 INFO L273 TraceCheckUtils]: 28: Hoare triple {15059#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15063#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:31:57,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {15063#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15067#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:31:57,435 INFO L273 TraceCheckUtils]: 30: Hoare triple {15067#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15071#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:31:57,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {15071#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15075#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:31:57,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {15075#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15079#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:31:57,437 INFO L273 TraceCheckUtils]: 33: Hoare triple {15079#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15083#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:31:57,438 INFO L273 TraceCheckUtils]: 34: Hoare triple {15083#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15087#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:31:57,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {15087#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15091#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:31:57,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {15091#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15095#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:31:57,440 INFO L273 TraceCheckUtils]: 37: Hoare triple {15095#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15099#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:31:57,441 INFO L273 TraceCheckUtils]: 38: Hoare triple {15099#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15103#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:31:57,442 INFO L273 TraceCheckUtils]: 39: Hoare triple {15103#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15107#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:31:57,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {15107#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15111#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:31:57,443 INFO L273 TraceCheckUtils]: 41: Hoare triple {15111#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15115#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:31:57,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {15115#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15119#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:31:57,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {15119#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15123#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:31:57,446 INFO L273 TraceCheckUtils]: 44: Hoare triple {15123#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15127#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:31:57,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {15127#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15131#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:31:57,447 INFO L273 TraceCheckUtils]: 46: Hoare triple {15131#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15135#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:31:57,448 INFO L273 TraceCheckUtils]: 47: Hoare triple {15135#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15139#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:31:57,449 INFO L273 TraceCheckUtils]: 48: Hoare triple {15139#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15143#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:31:57,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {15143#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15147#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:31:57,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {15147#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15151#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:31:57,451 INFO L273 TraceCheckUtils]: 51: Hoare triple {15151#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15155#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:31:57,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {15155#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15159#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:31:57,453 INFO L273 TraceCheckUtils]: 53: Hoare triple {15159#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15163#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:31:57,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {15163#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15167#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:31:57,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {15167#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15171#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:31:57,455 INFO L273 TraceCheckUtils]: 56: Hoare triple {15171#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15175#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:31:57,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {15175#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15179#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:31:57,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {15179#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15183#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:31:57,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {15183#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15187#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:31:57,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {15187#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} assume !(#memory_int[main_p1] >= 0); {14949#false} is VALID [2019-05-15 10:31:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:31:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:31:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-15 10:31:57,465 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-05-15 10:31:57,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:31:57,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states. [2019-05-15 10:31:57,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:31:57,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-05-15 10:31:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-15 10:31:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:31:57,519 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 60 states. [2019-05-15 10:32:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:04,582 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:04,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-15 10:32:04,582 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 61 [2019-05-15 10:32:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:32:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:32:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-05-15 10:32:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-05-15 10:32:04,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2019-05-15 10:32:04,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:04,635 INFO L225 Difference]: With dead ends: 63 [2019-05-15 10:32:04,635 INFO L226 Difference]: Without dead ends: 63 [2019-05-15 10:32:04,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-05-15 10:32:04,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-05-15 10:32:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-05-15 10:32:04,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:04,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:04,638 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:04,638 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:04,638 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:04,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:04,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:04,639 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:04,639 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2019-05-15 10:32:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:04,639 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-05-15 10:32:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:04,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:04,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:04,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:04,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:32:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-05-15 10:32:04,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-05-15 10:32:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:04,641 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-05-15 10:32:04,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-05-15 10:32:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-05-15 10:32:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-05-15 10:32:04,641 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:04,641 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-05-15 10:32:04,641 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2012381752, now seen corresponding path program 58 times [2019-05-15 10:32:04,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:04,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-15 10:32:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:04,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:04,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:32:04,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:04,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1718|]. (= |#memory_int| (store |v_#memory_int_1718| ULTIMATE.start_main_p1 0)) [2019-05-15 10:32:04,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:04,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1719|]. (let ((.cse0 (select |v_#memory_int_1719| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_1719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:04,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1720|]. (let ((.cse0 (select |v_#memory_int_1720| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:32:04,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:04,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1721|]. (let ((.cse0 (select |v_#memory_int_1721| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_1721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:04,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1722|]. (let ((.cse0 (select |v_#memory_int_1722| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_1722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:04,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:04,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1723|]. (let ((.cse0 (select |v_#memory_int_1723| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1723| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:04,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:04,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1724|]. (let ((.cse0 (select |v_#memory_int_1724| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1724| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:32:04,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:04,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1725|]. (let ((.cse0 (select |v_#memory_int_1725| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:32:04,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:04,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,907 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1726|]. (let ((.cse0 (select |v_#memory_int_1726| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1726| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:32:04,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:04,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1727|]. (let ((.cse0 (select |v_#memory_int_1727| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1727| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:32:04,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:04,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:04,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:04,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:04,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:04,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:04,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1728|]. (let ((.cse0 (select |v_#memory_int_1728| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_1728| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:04,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:05,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1729|]. (let ((.cse0 (select |v_#memory_int_1729| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1729| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:32:05,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:05,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1730|]. (let ((.cse0 (select |v_#memory_int_1730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:32:05,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:05,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1731|]. (let ((.cse0 (select |v_#memory_int_1731| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:05,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:05,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,524 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1732|]. (let ((.cse0 (select |v_#memory_int_1732| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1732| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:32:05,524 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:05,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1733|]. (let ((.cse0 (select |v_#memory_int_1733| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_1733| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:05,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:05,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1734|]. (let ((.cse0 (select |v_#memory_int_1734| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1734| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:32:05,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:05,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1735|]. (let ((.cse0 (select |v_#memory_int_1735| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_1735| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:05,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:05,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1736|]. (let ((.cse0 (select |v_#memory_int_1736| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:32:05,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:05,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1737|]. (let ((.cse0 (select |v_#memory_int_1737| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_1737| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:05,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:05,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1738|]. (let ((.cse0 (select |v_#memory_int_1738| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_1738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:05,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:05,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1739|]. (let ((.cse0 (select |v_#memory_int_1739| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1739| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:32:05,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:05,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1740|]. (let ((.cse0 (select |v_#memory_int_1740| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1740| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:05,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:05,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1741|]. (let ((.cse0 (select |v_#memory_int_1741| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_1741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:05,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:05,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1742|]. (let ((.cse0 (select |v_#memory_int_1742| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_1742| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:05,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:05,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,934 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1743|]. (let ((.cse0 (select |v_#memory_int_1743| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1743| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:05,934 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:05,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:05,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:05,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:05,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:05,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:05,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1744|]. (let ((.cse0 (select |v_#memory_int_1744| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_1744| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:05,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:06,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1745|]. (let ((.cse0 (select |v_#memory_int_1745| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:06,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1746|]. (let ((.cse0 (select |v_#memory_int_1746| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1746| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:32:06,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:06,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1747|]. (let ((.cse0 (select |v_#memory_int_1747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:32:06,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:06,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1748|]. (let ((.cse0 (select |v_#memory_int_1748| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1748| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:06,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:06,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1749|]. (let ((.cse0 (select |v_#memory_int_1749| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:32:06,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:06,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1750|]. (let ((.cse0 (select |v_#memory_int_1750| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_1750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:06,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1751|]. (let ((.cse0 (select |v_#memory_int_1751| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1751| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:32:06,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:06,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1752|]. (let ((.cse0 (select |v_#memory_int_1752| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_1752| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:06,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1753|]. (let ((.cse0 (select |v_#memory_int_1753| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_1753| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:06,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:06,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1754|]. (let ((.cse0 (select |v_#memory_int_1754| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1754| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:32:06,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:06,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1755|]. (let ((.cse0 (select |v_#memory_int_1755| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1755| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:06,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:06,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,520 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1756|]. (let ((.cse0 (select |v_#memory_int_1756| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1756| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:32:06,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:06,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,570 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1757|]. (let ((.cse0 (select |v_#memory_int_1757| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1757| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:32:06,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:06,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1758|]. (let ((.cse0 (select |v_#memory_int_1758| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1758| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 39 .cse0))) [2019-05-15 10:32:06,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:06,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1759|]. (let ((.cse0 (select |v_#memory_int_1759| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1759| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:32:06,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:06,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1760|]. (let ((.cse0 (select |v_#memory_int_1760| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_1760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:06,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1761|]. (let ((.cse0 (select |v_#memory_int_1761| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:32:06,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:06,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1762|]. (let ((.cse0 (select |v_#memory_int_1762| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= |#memory_int| (store |v_#memory_int_1762| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:06,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:06,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1763|]. (let ((.cse0 (select |v_#memory_int_1763| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_1763| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:06,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:06,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:06,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:06,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:06,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:06,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1764|]. (let ((.cse0 (select |v_#memory_int_1764| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_1764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:06,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:07,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,066 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1765|]. (let ((.cse0 (select |v_#memory_int_1765| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= |#memory_int| (store |v_#memory_int_1765| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:07,066 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:07,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1766|]. (let ((.cse0 (select |v_#memory_int_1766| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1766| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:32:07,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:07,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1767|]. (let ((.cse0 (select |v_#memory_int_1767| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1767| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:32:07,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:07,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1768|]. (let ((.cse0 (select |v_#memory_int_1768| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:07,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:07,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,434 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1769|]. (let ((.cse0 (select |v_#memory_int_1769| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1769| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 50 .cse0))) [2019-05-15 10:32:07,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:07,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1770|]. (let ((.cse0 (select |v_#memory_int_1770| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:32:07,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:07,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1771|]. (let ((.cse0 (select |v_#memory_int_1771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:32:07,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:07,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1772|]. (let ((.cse0 (select |v_#memory_int_1772| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1772| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:07,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:07,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1773|]. (let ((.cse0 (select |v_#memory_int_1773| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_1773| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:07,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:07,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,734 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1774|]. (let ((.cse0 (select |v_#memory_int_1774| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1774| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:32:07,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:07,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1775|]. (let ((.cse0 (select |v_#memory_int_1775| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_1775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:07,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:07,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:07,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:07,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:07,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:07,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:07,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1776|]. (let ((.cse0 (select |v_#memory_int_1776| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_1776| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:07,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:07,909 INFO L273 TraceCheckUtils]: 0: Hoare triple {15442#true} havoc main_p1; {15442#true} is VALID [2019-05-15 10:32:07,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {15442#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {15442#true} is VALID [2019-05-15 10:32:07,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {15442#true} #memory_int := #memory_int[main_p1 := 0]; {15453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:07,911 INFO L273 TraceCheckUtils]: 3: Hoare triple {15453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15457#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:07,912 INFO L273 TraceCheckUtils]: 4: Hoare triple {15457#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15461#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:07,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {15461#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15465#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:07,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {15465#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15469#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:07,914 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15473#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:07,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {15473#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15477#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:07,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {15477#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15481#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:07,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {15481#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15485#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:07,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {15485#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15489#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:07,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {15489#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15493#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:07,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {15493#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15497#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:07,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {15497#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15501#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:07,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {15501#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15505#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:07,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {15505#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15509#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:07,922 INFO L273 TraceCheckUtils]: 17: Hoare triple {15509#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15513#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:07,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {15513#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15517#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:07,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {15517#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15521#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:07,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {15521#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15525#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:07,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {15525#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15529#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:07,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {15529#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15533#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:07,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {15533#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15537#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:07,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {15537#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15541#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:07,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {15541#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15545#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:07,928 INFO L273 TraceCheckUtils]: 26: Hoare triple {15545#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15549#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:07,929 INFO L273 TraceCheckUtils]: 27: Hoare triple {15549#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15553#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:07,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {15553#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15557#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:07,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {15557#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15561#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:07,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {15561#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15565#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:07,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {15565#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15569#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:07,933 INFO L273 TraceCheckUtils]: 32: Hoare triple {15569#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15573#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:07,934 INFO L273 TraceCheckUtils]: 33: Hoare triple {15573#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15577#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:07,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {15577#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15581#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:07,935 INFO L273 TraceCheckUtils]: 35: Hoare triple {15581#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15585#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:07,936 INFO L273 TraceCheckUtils]: 36: Hoare triple {15585#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15589#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:07,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {15589#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15593#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:07,937 INFO L273 TraceCheckUtils]: 38: Hoare triple {15593#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15597#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:07,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {15597#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15601#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:07,939 INFO L273 TraceCheckUtils]: 40: Hoare triple {15601#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15605#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:07,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {15605#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15609#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:07,940 INFO L273 TraceCheckUtils]: 42: Hoare triple {15609#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15613#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:07,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {15613#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15617#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:07,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {15617#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15621#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:07,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {15621#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15625#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:07,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {15625#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15629#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:07,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {15629#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15633#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:07,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {15633#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15637#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:07,946 INFO L273 TraceCheckUtils]: 49: Hoare triple {15637#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15641#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:07,946 INFO L273 TraceCheckUtils]: 50: Hoare triple {15641#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15645#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:07,947 INFO L273 TraceCheckUtils]: 51: Hoare triple {15645#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15649#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:07,948 INFO L273 TraceCheckUtils]: 52: Hoare triple {15649#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15653#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:07,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {15653#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15657#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:07,949 INFO L273 TraceCheckUtils]: 54: Hoare triple {15657#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15661#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:07,950 INFO L273 TraceCheckUtils]: 55: Hoare triple {15661#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15665#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:07,951 INFO L273 TraceCheckUtils]: 56: Hoare triple {15665#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15669#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:07,952 INFO L273 TraceCheckUtils]: 57: Hoare triple {15669#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15673#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:07,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {15673#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15677#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:07,953 INFO L273 TraceCheckUtils]: 59: Hoare triple {15677#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15681#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:07,954 INFO L273 TraceCheckUtils]: 60: Hoare triple {15681#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15685#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:07,955 INFO L273 TraceCheckUtils]: 61: Hoare triple {15685#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} assume !(#memory_int[main_p1] >= 0); {15443#false} is VALID [2019-05-15 10:32:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:07,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-15 10:32:07,962 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-05-15 10:32:07,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:07,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states. [2019-05-15 10:32:08,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:08,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-05-15 10:32:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-15 10:32:08,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-05-15 10:32:08,015 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 61 states. [2019-05-15 10:32:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:15,426 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:15,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-15 10:32:15,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 62 [2019-05-15 10:32:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:32:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-05-15 10:32:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-05-15 10:32:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-05-15 10:32:15,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 65 transitions. [2019-05-15 10:32:15,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:15,483 INFO L225 Difference]: With dead ends: 64 [2019-05-15 10:32:15,483 INFO L226 Difference]: Without dead ends: 64 [2019-05-15 10:32:15,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-05-15 10:32:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-05-15 10:32:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-05-15 10:32:15,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:15,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:15,485 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:15,485 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:15,486 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:15,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:15,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:15,487 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:15,487 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2019-05-15 10:32:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:15,488 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-05-15 10:32:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:15,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:15,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:15,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:15,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-05-15 10:32:15,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-05-15 10:32:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:15,489 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-05-15 10:32:15,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-05-15 10:32:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-05-15 10:32:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-05-15 10:32:15,490 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:15,490 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-05-15 10:32:15,490 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 2040675074, now seen corresponding path program 59 times [2019-05-15 10:32:15,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:15,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-15 10:32:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:15,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:15,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:32:15,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:15,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1777|]. (= (store |v_#memory_int_1777| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:15,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:15,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1778|]. (let ((.cse0 (select |v_#memory_int_1778| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1778| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0))) [2019-05-15 10:32:15,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:15,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1779|]. (let ((.cse0 (select |v_#memory_int_1779| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1779| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:15,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1780|]. (let ((.cse0 (select |v_#memory_int_1780| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:32:15,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:15,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1781|]. (let ((.cse0 (select |v_#memory_int_1781| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1781| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:32:15,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:15,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,684 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1782|]. (let ((.cse0 (select |v_#memory_int_1782| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:32:15,684 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:15,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1783|]. (let ((.cse0 (select |v_#memory_int_1783| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:32:15,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:15,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,734 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1784|]. (let ((.cse0 (select |v_#memory_int_1784| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_1784| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:15,734 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:15,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1785|]. (let ((.cse0 (select |v_#memory_int_1785| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_1785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:15,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1786|]. (let ((.cse0 (select |v_#memory_int_1786| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_1786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:15,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1787|]. (let ((.cse0 (select |v_#memory_int_1787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:32:15,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:15,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,840 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1788|]. (let ((.cse0 (select |v_#memory_int_1788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:32:15,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:15,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1789|]. (let ((.cse0 (select |v_#memory_int_1789| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1789| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:32:15,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:15,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1790|]. (let ((.cse0 (select |v_#memory_int_1790| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_1790| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:15,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:15,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1791|]. (let ((.cse0 (select |v_#memory_int_1791| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1791| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:15,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1792|]. (let ((.cse0 (select |v_#memory_int_1792| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_1792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:15,958 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:15,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:15,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:15,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:15,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:15,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:15,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1793|]. (let ((.cse0 (select |v_#memory_int_1793| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_1793| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:15,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:16,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1794|]. (let ((.cse0 (select |v_#memory_int_1794| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1794| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:32:16,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:16,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,054 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1795|]. (let ((.cse0 (select |v_#memory_int_1795| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:16,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1796|]. (let ((.cse0 (select |v_#memory_int_1796| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1796| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:32:16,090 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:16,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1797|]. (let ((.cse0 (select |v_#memory_int_1797| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_1797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:16,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1798|]. (let ((.cse0 (select |v_#memory_int_1798| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1798| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:32:16,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:16,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1799|]. (let ((.cse0 (select |v_#memory_int_1799| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_1799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:16,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1800|]. (let ((.cse0 (select |v_#memory_int_1800| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1800| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:32:16,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:16,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1801|]. (let ((.cse0 (select |v_#memory_int_1801| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_1801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:16,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1802|]. (let ((.cse0 (select |v_#memory_int_1802| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_1802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:16,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1803|]. (let ((.cse0 (select |v_#memory_int_1803| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1803| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:16,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:16,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1804|]. (let ((.cse0 (select |v_#memory_int_1804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:32:16,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:16,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1805|]. (let ((.cse0 (select |v_#memory_int_1805| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_1805| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:16,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:16,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1806|]. (let ((.cse0 (select |v_#memory_int_1806| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1806| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:32:16,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:16,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,807 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1807|]. (let ((.cse0 (select |v_#memory_int_1807| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_1807| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:16,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:16,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1808|]. (let ((.cse0 (select |v_#memory_int_1808| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:32:16,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:16,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1809|]. (let ((.cse0 (select |v_#memory_int_1809| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1809| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:32:16,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:16,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1810|]. (let ((.cse0 (select |v_#memory_int_1810| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1810| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:16,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:16,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:16,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:16,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:16,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:16,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:16,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1811|]. (let ((.cse0 (select |v_#memory_int_1811| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1811| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:32:16,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:17,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,029 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1812|]. (let ((.cse0 (select |v_#memory_int_1812| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1812| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:32:17,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:17,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1813|]. (let ((.cse0 (select |v_#memory_int_1813| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_1813| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:17,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:17,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,126 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1814|]. (let ((.cse0 (select |v_#memory_int_1814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:17,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:17,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1815|]. (let ((.cse0 (select |v_#memory_int_1815| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_1815| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:17,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:17,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1816|]. (let ((.cse0 (select |v_#memory_int_1816| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1816| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:32:17,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:17,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1817|]. (let ((.cse0 (select |v_#memory_int_1817| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_1817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:17,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:17,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1818|]. (let ((.cse0 (select |v_#memory_int_1818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:32:17,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:17,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1819|]. (let ((.cse0 (select |v_#memory_int_1819| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_1819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:17,674 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:17,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1820|]. (let ((.cse0 (select |v_#memory_int_1820| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:32:17,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:17,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1821|]. (let ((.cse0 (select |v_#memory_int_1821| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_1821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:17,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:17,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,839 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1822|]. (let ((.cse0 (select |v_#memory_int_1822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:32:17,839 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:17,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1823|]. (let ((.cse0 (select |v_#memory_int_1823| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1823| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:32:17,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:17,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:17,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:17,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:17,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:17,950 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:17,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1824|]. (let ((.cse0 (select |v_#memory_int_1824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:32:17,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:17,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1825|]. (let ((.cse0 (select |v_#memory_int_1825| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_1825| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:18,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:18,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,069 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1826|]. (let ((.cse0 (select |v_#memory_int_1826| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_1826| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:18,070 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:18,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,125 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1827|]. (let ((.cse0 (select |v_#memory_int_1827| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1827| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 49 .cse0))) [2019-05-15 10:32:18,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:18,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1828|]. (let ((.cse0 (select |v_#memory_int_1828| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_1828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:18,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:18,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1829|]. (let ((.cse0 (select |v_#memory_int_1829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:32:18,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:18,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1830|]. (let ((.cse0 (select |v_#memory_int_1830| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1830| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:32:18,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:18,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1831|]. (let ((.cse0 (select |v_#memory_int_1831| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1831| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:18,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:18,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1832|]. (let ((.cse0 (select |v_#memory_int_1832| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_1832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:18,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:18,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1833|]. (let ((.cse0 (select |v_#memory_int_1833| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:32:18,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:18,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1834|]. (let ((.cse0 (select |v_#memory_int_1834| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= |#memory_int| (store |v_#memory_int_1834| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:18,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:18,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1835|]. (let ((.cse0 (select |v_#memory_int_1835| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_1835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:18,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:18,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:18,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:18,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:18,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:18,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:18,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1836|]. (let ((.cse0 (select |v_#memory_int_1836| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_1836| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:18,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:18,754 INFO L273 TraceCheckUtils]: 0: Hoare triple {15944#true} havoc main_p1; {15944#true} is VALID [2019-05-15 10:32:18,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {15944#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {15944#true} is VALID [2019-05-15 10:32:18,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {15944#true} #memory_int := #memory_int[main_p1 := 0]; {15955#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:18,755 INFO L273 TraceCheckUtils]: 3: Hoare triple {15955#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15959#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:18,756 INFO L273 TraceCheckUtils]: 4: Hoare triple {15959#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15963#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:18,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {15963#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15967#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:18,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {15967#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15971#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:18,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {15971#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15975#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:18,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {15975#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15979#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:18,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {15979#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15983#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:18,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {15983#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15987#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:18,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {15987#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15991#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:18,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {15991#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15995#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:18,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {15995#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {15999#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:18,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {15999#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16003#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:18,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {16003#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16007#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:18,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {16007#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16011#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:18,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {16011#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16015#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:18,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {16015#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16019#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:18,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {16019#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16023#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:18,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {16023#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16027#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:18,768 INFO L273 TraceCheckUtils]: 21: Hoare triple {16027#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16031#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:18,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {16031#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16035#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:18,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {16035#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16039#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:18,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {16039#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16043#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:18,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {16043#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16047#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:18,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {16047#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16051#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:18,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {16051#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16055#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:18,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {16055#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16059#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:18,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {16059#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16063#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:18,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {16063#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16067#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:18,783 INFO L273 TraceCheckUtils]: 31: Hoare triple {16067#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16071#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:18,784 INFO L273 TraceCheckUtils]: 32: Hoare triple {16071#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16075#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:18,785 INFO L273 TraceCheckUtils]: 33: Hoare triple {16075#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16079#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:18,785 INFO L273 TraceCheckUtils]: 34: Hoare triple {16079#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16083#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:18,786 INFO L273 TraceCheckUtils]: 35: Hoare triple {16083#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16087#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:18,786 INFO L273 TraceCheckUtils]: 36: Hoare triple {16087#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16091#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:18,787 INFO L273 TraceCheckUtils]: 37: Hoare triple {16091#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16095#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:18,787 INFO L273 TraceCheckUtils]: 38: Hoare triple {16095#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16099#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:18,788 INFO L273 TraceCheckUtils]: 39: Hoare triple {16099#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16103#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:18,789 INFO L273 TraceCheckUtils]: 40: Hoare triple {16103#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16107#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:18,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {16107#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16111#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:18,790 INFO L273 TraceCheckUtils]: 42: Hoare triple {16111#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16115#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:18,791 INFO L273 TraceCheckUtils]: 43: Hoare triple {16115#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16119#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:18,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {16119#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16123#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:18,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {16123#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16127#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:18,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {16127#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16131#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:18,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {16131#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16135#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:18,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {16135#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16139#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:18,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {16139#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16143#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:18,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {16143#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16147#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:18,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {16147#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16151#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:18,798 INFO L273 TraceCheckUtils]: 52: Hoare triple {16151#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16155#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:18,798 INFO L273 TraceCheckUtils]: 53: Hoare triple {16155#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16159#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:18,799 INFO L273 TraceCheckUtils]: 54: Hoare triple {16159#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16163#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:18,800 INFO L273 TraceCheckUtils]: 55: Hoare triple {16163#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16167#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:18,801 INFO L273 TraceCheckUtils]: 56: Hoare triple {16167#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16171#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:18,801 INFO L273 TraceCheckUtils]: 57: Hoare triple {16171#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16175#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:18,802 INFO L273 TraceCheckUtils]: 58: Hoare triple {16175#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16179#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:18,803 INFO L273 TraceCheckUtils]: 59: Hoare triple {16179#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16183#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:18,804 INFO L273 TraceCheckUtils]: 60: Hoare triple {16183#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16187#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:18,804 INFO L273 TraceCheckUtils]: 61: Hoare triple {16187#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16191#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:18,805 INFO L273 TraceCheckUtils]: 62: Hoare triple {16191#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} assume !(#memory_int[main_p1] >= 0); {15945#false} is VALID [2019-05-15 10:32:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:18,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:18,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-15 10:32:18,812 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-05-15 10:32:18,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:18,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states. [2019-05-15 10:32:18,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:18,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-05-15 10:32:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-15 10:32:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:32:18,865 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 62 states. [2019-05-15 10:32:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:26,409 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-15 10:32:26,409 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 63 [2019-05-15 10:32:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-05-15 10:32:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-05-15 10:32:26,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2019-05-15 10:32:26,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:26,475 INFO L225 Difference]: With dead ends: 65 [2019-05-15 10:32:26,475 INFO L226 Difference]: Without dead ends: 65 [2019-05-15 10:32:26,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-05-15 10:32:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-05-15 10:32:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-05-15 10:32:26,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:26,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:26,477 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:26,477 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:26,478 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:26,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:26,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:26,479 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:26,479 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2019-05-15 10:32:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:26,479 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-05-15 10:32:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:26,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:26,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:26,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:26,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:26,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:32:26,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-05-15 10:32:26,480 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-05-15 10:32:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:26,481 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-05-15 10:32:26,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-05-15 10:32:26,481 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-05-15 10:32:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-05-15 10:32:26,481 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:26,481 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-05-15 10:32:26,481 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1163582200, now seen corresponding path program 60 times [2019-05-15 10:32:26,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:26,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-15 10:32:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:26,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:26,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:32:26,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:26,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1837|]. (= (store |v_#memory_int_1837| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:26,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:26,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1838|]. (let ((.cse0 (select |v_#memory_int_1838| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:32:26,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:26,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1839|]. (let ((.cse0 (select |v_#memory_int_1839| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:26,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:26,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1840|]. (let ((.cse0 (select |v_#memory_int_1840| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1840| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:32:26,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:26,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1841|]. (let ((.cse0 (select |v_#memory_int_1841| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:32:26,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:26,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1842|]. (let ((.cse0 (select |v_#memory_int_1842| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:32:26,752 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:26,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1843|]. (let ((.cse0 (select |v_#memory_int_1843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:32:26,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:26,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1844|]. (let ((.cse0 (select |v_#memory_int_1844| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_1844| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:26,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:26,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1845|]. (let ((.cse0 (select |v_#memory_int_1845| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1845| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:32:26,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:26,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,841 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1846|]. (let ((.cse0 (select |v_#memory_int_1846| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:32:26,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:26,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1847|]. (let ((.cse0 (select |v_#memory_int_1847| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:26,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:26,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1848|]. (let ((.cse0 (select |v_#memory_int_1848| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1848| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:32:26,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:26,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1849|]. (let ((.cse0 (select |v_#memory_int_1849| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:26,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:26,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1850|]. (let ((.cse0 (select |v_#memory_int_1850| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:26,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:26,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:26,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:26,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:26,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:26,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:26,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1851|]. (let ((.cse0 (select |v_#memory_int_1851| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_1851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:26,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:27,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1852|]. (let ((.cse0 (select |v_#memory_int_1852| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:32:27,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:27,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1853|]. (let ((.cse0 (select |v_#memory_int_1853| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1853| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:32:27,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:27,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1854|]. (let ((.cse0 (select |v_#memory_int_1854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:32:27,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:27,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,111 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1855|]. (let ((.cse0 (select |v_#memory_int_1855| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_1855| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:27,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:27,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,144 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,144 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1856|]. (let ((.cse0 (select |v_#memory_int_1856| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:32:27,144 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:27,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,177 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1857|]. (let ((.cse0 (select |v_#memory_int_1857| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1857| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:32:27,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:27,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:27,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:27,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:27,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:27,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1858|]. (let ((.cse0 (select |v_#memory_int_1858| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1858| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 20))) [2019-05-15 10:32:27,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:27,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:27,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:28,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:28,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:28,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:28,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:28,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1859|]. (let ((.cse0 (select |v_#memory_int_1859| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:32:28,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:28,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:28,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:28,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:28,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:28,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:28,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:28,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1860|]. (let ((.cse0 (select |v_#memory_int_1860| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:28,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:29,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1861|]. (let ((.cse0 (select |v_#memory_int_1861| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1861| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:32:29,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:29,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1862|]. (let ((.cse0 (select |v_#memory_int_1862| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1862| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:32:29,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:29,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1863|]. (let ((.cse0 (select |v_#memory_int_1863| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_1863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:29,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:29,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1864|]. (let ((.cse0 (select |v_#memory_int_1864| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_1864| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:29,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:29,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1865|]. (let ((.cse0 (select |v_#memory_int_1865| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_1865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:29,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:29,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1866|]. (let ((.cse0 (select |v_#memory_int_1866| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_1866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:29,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:29,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1867|]. (let ((.cse0 (select |v_#memory_int_1867| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:32:29,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:29,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1868|]. (let ((.cse0 (select |v_#memory_int_1868| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:29,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:29,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1869|]. (let ((.cse0 (select |v_#memory_int_1869| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_1869| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:29,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:29,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1870|]. (let ((.cse0 (select |v_#memory_int_1870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:32:29,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:29,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1871|]. (let ((.cse0 (select |v_#memory_int_1871| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_1871| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:29,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:29,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:29,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:29,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:29,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:29,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:29,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1872|]. (let ((.cse0 (select |v_#memory_int_1872| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_1872| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:29,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:30,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:30,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:30,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:30,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:30,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1873|]. (let ((.cse0 (select |v_#memory_int_1873| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1873| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:30,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:30,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:30,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:30,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:30,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:30,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1874|]. (let ((.cse0 (select |v_#memory_int_1874| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:32:30,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:30,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:30,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:30,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:30,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:30,203 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:30,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1875|]. (let ((.cse0 (select |v_#memory_int_1875| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:32:30,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:31,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:31,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:31,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:31,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:31,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:31,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1876|]. (let ((.cse0 (select |v_#memory_int_1876| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_1876| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:31,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:32,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1877|]. (let ((.cse0 (select |v_#memory_int_1877| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:32:32,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:32,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1878|]. (let ((.cse0 (select |v_#memory_int_1878| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_1878| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:32,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:32,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1879|]. (let ((.cse0 (select |v_#memory_int_1879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:32:32,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:32,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1880|]. (let ((.cse0 (select |v_#memory_int_1880| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1880| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:32:32,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:32,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1881|]. (let ((.cse0 (select |v_#memory_int_1881| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_1881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:32,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:32,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:32,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:32,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:32,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:32,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:32,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1882|]. (let ((.cse0 (select |v_#memory_int_1882| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_1882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:32,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:33,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1883|]. (let ((.cse0 (select |v_#memory_int_1883| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_1883| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:33,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:33,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1884|]. (let ((.cse0 (select |v_#memory_int_1884| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_1884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:33,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:33,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1885|]. (let ((.cse0 (select |v_#memory_int_1885| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_1885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:33,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:33,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1886|]. (let ((.cse0 (select |v_#memory_int_1886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:32:33,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:33,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1887|]. (let ((.cse0 (select |v_#memory_int_1887| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:33,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:33,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1888|]. (let ((.cse0 (select |v_#memory_int_1888| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1888| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:32:33,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:33,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1889|]. (let ((.cse0 (select |v_#memory_int_1889| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:32:33,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:33,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1890|]. (let ((.cse0 (select |v_#memory_int_1890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 52))) [2019-05-15 10:32:33,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:33,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1891|]. (let ((.cse0 (select |v_#memory_int_1891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:32:33,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:33,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,600 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1892|]. (let ((.cse0 (select |v_#memory_int_1892| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:32:33,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:33,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1893|]. (let ((.cse0 (select |v_#memory_int_1893| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1893| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:32:33,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:33,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1894|]. (let ((.cse0 (select |v_#memory_int_1894| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1894| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:32:33,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:33,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1895|]. (let ((.cse0 (select |v_#memory_int_1895| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_1895| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:33,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:33,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1896|]. (let ((.cse0 (select |v_#memory_int_1896| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= |#memory_int| (store |v_#memory_int_1896| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:33,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:33,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:33,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:33,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:33,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:33,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:33,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1897|]. (let ((.cse0 (select |v_#memory_int_1897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 59))) [2019-05-15 10:32:33,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:32:33,990 INFO L273 TraceCheckUtils]: 0: Hoare triple {16454#true} havoc main_p1; {16454#true} is VALID [2019-05-15 10:32:33,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {16454#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {16454#true} is VALID [2019-05-15 10:32:33,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {16454#true} #memory_int := #memory_int[main_p1 := 0]; {16465#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:33,992 INFO L273 TraceCheckUtils]: 3: Hoare triple {16465#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16469#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:33,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {16469#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16473#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:33,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {16473#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16477#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:33,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {16477#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16481#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:33,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {16481#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16485#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:33,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {16485#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16489#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:33,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {16489#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16493#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:33,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {16493#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16497#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:33,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {16497#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16501#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:33,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {16501#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16505#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:33,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {16505#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16509#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:33,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {16509#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16513#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:34,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {16513#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16517#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:34,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {16517#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16521#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:34,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {16521#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16525#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:34,002 INFO L273 TraceCheckUtils]: 18: Hoare triple {16525#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16529#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:34,003 INFO L273 TraceCheckUtils]: 19: Hoare triple {16529#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16533#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:34,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {16533#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16537#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:34,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {16537#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16541#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:34,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {16541#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16545#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:34,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {16545#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16549#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:34,006 INFO L273 TraceCheckUtils]: 24: Hoare triple {16549#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16553#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:34,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {16553#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16557#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:34,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {16557#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16561#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:34,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {16561#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16565#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:34,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {16565#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16569#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:34,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {16569#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16573#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:34,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {16573#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16577#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:34,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {16577#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16581#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:34,012 INFO L273 TraceCheckUtils]: 32: Hoare triple {16581#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16585#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:34,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {16585#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16589#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:34,014 INFO L273 TraceCheckUtils]: 34: Hoare triple {16589#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16593#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:34,015 INFO L273 TraceCheckUtils]: 35: Hoare triple {16593#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16597#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:34,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {16597#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16601#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:34,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {16601#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16605#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:34,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {16605#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16609#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:34,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {16609#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16613#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:34,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {16613#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16617#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:34,019 INFO L273 TraceCheckUtils]: 41: Hoare triple {16617#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16621#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:34,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {16621#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16625#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:34,021 INFO L273 TraceCheckUtils]: 43: Hoare triple {16625#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16629#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:34,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {16629#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16633#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:34,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {16633#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16637#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:34,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {16637#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16641#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:34,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {16641#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16645#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:34,025 INFO L273 TraceCheckUtils]: 48: Hoare triple {16645#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16649#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:34,025 INFO L273 TraceCheckUtils]: 49: Hoare triple {16649#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16653#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:34,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {16653#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16657#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:34,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {16657#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16661#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:34,028 INFO L273 TraceCheckUtils]: 52: Hoare triple {16661#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16665#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:34,028 INFO L273 TraceCheckUtils]: 53: Hoare triple {16665#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16669#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:34,029 INFO L273 TraceCheckUtils]: 54: Hoare triple {16669#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16673#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:34,030 INFO L273 TraceCheckUtils]: 55: Hoare triple {16673#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16677#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:34,031 INFO L273 TraceCheckUtils]: 56: Hoare triple {16677#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16681#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:34,031 INFO L273 TraceCheckUtils]: 57: Hoare triple {16681#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16685#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:34,032 INFO L273 TraceCheckUtils]: 58: Hoare triple {16685#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16689#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:34,033 INFO L273 TraceCheckUtils]: 59: Hoare triple {16689#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16693#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:34,034 INFO L273 TraceCheckUtils]: 60: Hoare triple {16693#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16697#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:34,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {16697#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16701#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:34,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {16701#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16705#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:32:34,036 INFO L273 TraceCheckUtils]: 63: Hoare triple {16705#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} assume !(#memory_int[main_p1] >= 0); {16455#false} is VALID [2019-05-15 10:32:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:34,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:34,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-15 10:32:34,044 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-05-15 10:32:34,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:34,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states. [2019-05-15 10:32:34,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:34,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-05-15 10:32:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-15 10:32:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-05-15 10:32:34,097 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 63 states. [2019-05-15 10:32:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:42,021 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:32:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-15 10:32:42,021 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 64 [2019-05-15 10:32:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:32:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-05-15 10:32:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-05-15 10:32:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-05-15 10:32:42,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 67 transitions. [2019-05-15 10:32:42,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:42,077 INFO L225 Difference]: With dead ends: 66 [2019-05-15 10:32:42,077 INFO L226 Difference]: Without dead ends: 66 [2019-05-15 10:32:42,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-05-15 10:32:42,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-05-15 10:32:42,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-05-15 10:32:42,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:42,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2019-05-15 10:32:42,080 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2019-05-15 10:32:42,080 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2019-05-15 10:32:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:42,081 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:32:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:32:42,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:42,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:42,082 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2019-05-15 10:32:42,082 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2019-05-15 10:32:42,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:42,083 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-05-15 10:32:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:32:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:42,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:42,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:32:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-05-15 10:32:42,084 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-05-15 10:32:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:42,085 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-05-15 10:32:42,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-05-15 10:32:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-05-15 10:32:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-05-15 10:32:42,085 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:42,085 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-05-15 10:32:42,085 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1711309886, now seen corresponding path program 61 times [2019-05-15 10:32:42,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:42,122 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-15 10:32:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:42,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:32:42,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:42,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1898|]. (= (store |v_#memory_int_1898| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:42,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:42,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1899|]. (let ((.cse0 (select |v_#memory_int_1899| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:42,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1900|]. (let ((.cse0 (select |v_#memory_int_1900| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_1900| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:42,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1901|]. (let ((.cse0 (select |v_#memory_int_1901| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:32:42,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:42,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1902|]. (let ((.cse0 (select |v_#memory_int_1902| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:32:42,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:42,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1903|]. (let ((.cse0 (select |v_#memory_int_1903| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_1903| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:42,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1904|]. (let ((.cse0 (select |v_#memory_int_1904| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_1904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:42,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1905|]. (let ((.cse0 (select |v_#memory_int_1905| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_1905| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:42,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1906|]. (let ((.cse0 (select |v_#memory_int_1906| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1906| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 7 .cse0))) [2019-05-15 10:32:42,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:42,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1907|]. (let ((.cse0 (select |v_#memory_int_1907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:32:42,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:42,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1908|]. (let ((.cse0 (select |v_#memory_int_1908| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_1908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,446 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:42,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1909|]. (let ((.cse0 (select |v_#memory_int_1909| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:32:42,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:42,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1910|]. (let ((.cse0 (select |v_#memory_int_1910| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:32:42,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:42,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1911|]. (let ((.cse0 (select |v_#memory_int_1911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:32:42,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:42,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1912|]. (let ((.cse0 (select |v_#memory_int_1912| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:32:42,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:42,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1913|]. (let ((.cse0 (select |v_#memory_int_1913| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1913| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:32:42,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:42,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1914|]. (let ((.cse0 (select |v_#memory_int_1914| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:32:42,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:42,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1915|]. (let ((.cse0 (select |v_#memory_int_1915| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1915| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:32:42,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:42,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1916|]. (let ((.cse0 (select |v_#memory_int_1916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:32:42,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:42,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1917|]. (let ((.cse0 (select |v_#memory_int_1917| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_1917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:42,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1918|]. (let ((.cse0 (select |v_#memory_int_1918| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:32:42,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:42,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1919|]. (let ((.cse0 (select |v_#memory_int_1919| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_1919| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:42,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:42,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1920|]. (let ((.cse0 (select |v_#memory_int_1920| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_1920| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:42,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1921|]. (let ((.cse0 (select |v_#memory_int_1921| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_1921| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:42,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1922|]. (let ((.cse0 (select |v_#memory_int_1922| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_1922| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:42,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:42,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:42,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:42,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:42,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1923|]. (let ((.cse0 (select |v_#memory_int_1923| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_1923| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:42,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:42,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:42,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1924|]. (let ((.cse0 (select |v_#memory_int_1924| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_1924| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:43,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:43,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1925|]. (let ((.cse0 (select |v_#memory_int_1925| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:32:43,047 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:43,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1926|]. (let ((.cse0 (select |v_#memory_int_1926| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1926| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:32:43,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:43,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1927|]. (let ((.cse0 (select |v_#memory_int_1927| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_1927| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:43,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:43,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1928|]. (let ((.cse0 (select |v_#memory_int_1928| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_1928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:43,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:43,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1929|]. (let ((.cse0 (select |v_#memory_int_1929| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1929| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:32:43,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:43,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1930|]. (let ((.cse0 (select |v_#memory_int_1930| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1930| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:32:43,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:43,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1931|]. (let ((.cse0 (select |v_#memory_int_1931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:32:43,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:43,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1932|]. (let ((.cse0 (select |v_#memory_int_1932| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:32:43,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:43,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1933|]. (let ((.cse0 (select |v_#memory_int_1933| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1933| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 34 .cse0))) [2019-05-15 10:32:43,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:43,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1934|]. (let ((.cse0 (select |v_#memory_int_1934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:32:43,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:43,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1935|]. (let ((.cse0 (select |v_#memory_int_1935| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:32:43,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:43,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1936|]. (let ((.cse0 (select |v_#memory_int_1936| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_1936| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:43,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:43,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,594 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1937|]. (let ((.cse0 (select |v_#memory_int_1937| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:32:43,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:43,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1938|]. (let ((.cse0 (select |v_#memory_int_1938| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1938| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:32:43,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:43,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1939|]. (let ((.cse0 (select |v_#memory_int_1939| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1939| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:32:43,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:43,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1940|]. (let ((.cse0 (select |v_#memory_int_1940| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_1940| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:43,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:43,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1941|]. (let ((.cse0 (select |v_#memory_int_1941| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_1941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:43,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:43,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1942|]. (let ((.cse0 (select |v_#memory_int_1942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 43 .cse0))) [2019-05-15 10:32:43,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:43,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1943|]. (let ((.cse0 (select |v_#memory_int_1943| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= |#memory_int| (store |v_#memory_int_1943| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:43,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:43,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:43,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:43,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:43,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:43,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:43,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1944|]. (let ((.cse0 (select |v_#memory_int_1944| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_1944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:43,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:44,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,049 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1945|]. (let ((.cse0 (select |v_#memory_int_1945| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_1945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:44,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:44,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1946|]. (let ((.cse0 (select |v_#memory_int_1946| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1946| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:32:44,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:44,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,165 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1947|]. (let ((.cse0 (select |v_#memory_int_1947| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1947| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:32:44,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:44,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1948|]. (let ((.cse0 (select |v_#memory_int_1948| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:32:44,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:44,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1949|]. (let ((.cse0 (select |v_#memory_int_1949| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_1949| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:44,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:44,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1950|]. (let ((.cse0 (select |v_#memory_int_1950| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1950| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 51))) [2019-05-15 10:32:44,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:44,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1951|]. (let ((.cse0 (select |v_#memory_int_1951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:32:44,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:44,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,451 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1952|]. (let ((.cse0 (select |v_#memory_int_1952| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_1952| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:44,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:44,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1953|]. (let ((.cse0 (select |v_#memory_int_1953| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1953| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:32:44,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:44,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1954|]. (let ((.cse0 (select |v_#memory_int_1954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:32:44,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:44,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1955|]. (let ((.cse0 (select |v_#memory_int_1955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:32:44,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:44,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1956|]. (let ((.cse0 (select |v_#memory_int_1956| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_1956| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:44,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:44,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1957|]. (let ((.cse0 (select |v_#memory_int_1957| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1957| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:32:44,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:44,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1958|]. (let ((.cse0 (select |v_#memory_int_1958| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:32:44,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:32:44,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:44,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:44,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:44,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:44,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:44,899 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1959|]. (let ((.cse0 (select |v_#memory_int_1959| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_1959| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:44,899 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:32:44,953 INFO L273 TraceCheckUtils]: 0: Hoare triple {16972#true} havoc main_p1; {16972#true} is VALID [2019-05-15 10:32:44,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {16972#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {16972#true} is VALID [2019-05-15 10:32:44,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {16972#true} #memory_int := #memory_int[main_p1 := 0]; {16983#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:44,955 INFO L273 TraceCheckUtils]: 3: Hoare triple {16983#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16987#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:44,955 INFO L273 TraceCheckUtils]: 4: Hoare triple {16987#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16991#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:44,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {16991#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16995#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:44,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {16995#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {16999#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:44,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {16999#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17003#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:44,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {17003#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17007#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:44,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {17007#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17011#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:44,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {17011#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17015#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:44,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {17015#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17019#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:44,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {17019#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17023#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:44,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {17023#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17027#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:44,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {17027#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17031#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:44,964 INFO L273 TraceCheckUtils]: 15: Hoare triple {17031#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17035#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:44,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {17035#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17039#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:44,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {17039#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17043#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:44,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {17043#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17047#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:44,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {17047#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17051#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:44,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {17051#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17055#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:44,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {17055#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17059#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:44,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {17059#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17063#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:44,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {17063#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17067#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:44,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {17067#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17071#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:44,971 INFO L273 TraceCheckUtils]: 25: Hoare triple {17071#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17075#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:44,972 INFO L273 TraceCheckUtils]: 26: Hoare triple {17075#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17079#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:44,973 INFO L273 TraceCheckUtils]: 27: Hoare triple {17079#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17083#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:44,973 INFO L273 TraceCheckUtils]: 28: Hoare triple {17083#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17087#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:44,974 INFO L273 TraceCheckUtils]: 29: Hoare triple {17087#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17091#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:44,975 INFO L273 TraceCheckUtils]: 30: Hoare triple {17091#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17095#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:44,976 INFO L273 TraceCheckUtils]: 31: Hoare triple {17095#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17099#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:44,976 INFO L273 TraceCheckUtils]: 32: Hoare triple {17099#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17103#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:44,977 INFO L273 TraceCheckUtils]: 33: Hoare triple {17103#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17107#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:44,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {17107#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17111#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:44,979 INFO L273 TraceCheckUtils]: 35: Hoare triple {17111#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17115#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:44,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {17115#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17119#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:44,980 INFO L273 TraceCheckUtils]: 37: Hoare triple {17119#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17123#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:44,981 INFO L273 TraceCheckUtils]: 38: Hoare triple {17123#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17127#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:44,982 INFO L273 TraceCheckUtils]: 39: Hoare triple {17127#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17131#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:44,982 INFO L273 TraceCheckUtils]: 40: Hoare triple {17131#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17135#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:44,983 INFO L273 TraceCheckUtils]: 41: Hoare triple {17135#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17139#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:44,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {17139#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17143#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:44,985 INFO L273 TraceCheckUtils]: 43: Hoare triple {17143#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17147#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:44,985 INFO L273 TraceCheckUtils]: 44: Hoare triple {17147#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17151#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:44,986 INFO L273 TraceCheckUtils]: 45: Hoare triple {17151#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17155#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:44,987 INFO L273 TraceCheckUtils]: 46: Hoare triple {17155#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17159#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:44,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {17159#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17163#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:44,988 INFO L273 TraceCheckUtils]: 48: Hoare triple {17163#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17167#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:44,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {17167#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17171#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:44,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {17171#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17175#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:44,991 INFO L273 TraceCheckUtils]: 51: Hoare triple {17175#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17179#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:44,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {17179#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17183#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:44,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {17183#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17187#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:44,993 INFO L273 TraceCheckUtils]: 54: Hoare triple {17187#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17191#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:44,994 INFO L273 TraceCheckUtils]: 55: Hoare triple {17191#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17195#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:44,994 INFO L273 TraceCheckUtils]: 56: Hoare triple {17195#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17199#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:44,995 INFO L273 TraceCheckUtils]: 57: Hoare triple {17199#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17203#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:44,996 INFO L273 TraceCheckUtils]: 58: Hoare triple {17203#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17207#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:44,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {17207#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17211#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:44,997 INFO L273 TraceCheckUtils]: 60: Hoare triple {17211#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17215#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:44,998 INFO L273 TraceCheckUtils]: 61: Hoare triple {17215#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17219#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:44,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {17219#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17223#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:32:45,000 INFO L273 TraceCheckUtils]: 63: Hoare triple {17223#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17227#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:32:45,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {17227#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} assume !(#memory_int[main_p1] >= 0); {16973#false} is VALID [2019-05-15 10:32:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:45,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:45,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-15 10:32:45,007 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-05-15 10:32:45,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:45,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2019-05-15 10:32:45,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:45,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-05-15 10:32:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-15 10:32:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:32:45,060 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 64 states. [2019-05-15 10:32:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,022 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-15 10:32:53,022 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 65 [2019-05-15 10:32:53,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:32:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:32:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-05-15 10:32:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-05-15 10:32:53,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2019-05-15 10:32:53,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:53,094 INFO L225 Difference]: With dead ends: 67 [2019-05-15 10:32:53,094 INFO L226 Difference]: Without dead ends: 67 [2019-05-15 10:32:53,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-05-15 10:32:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-05-15 10:32:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-05-15 10:32:53,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:32:53,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:53,096 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:53,096 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,097 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:53,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:53,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:53,098 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:53,098 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2019-05-15 10:32:53,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:32:53,099 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-05-15 10:32:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:53,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:32:53,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:32:53,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:32:53,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:32:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:32:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-05-15 10:32:53,100 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-05-15 10:32:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:32:53,100 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-05-15 10:32:53,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-05-15 10:32:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-05-15 10:32:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-05-15 10:32:53,101 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:32:53,101 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-05-15 10:32:53,101 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:32:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:32:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1510998968, now seen corresponding path program 62 times [2019-05-15 10:32:53,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:32:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:53,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-15 10:32:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:32:53,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:32:53,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:32:53,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:32:53,173 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1960|]. (= (store |v_#memory_int_1960| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:32:53,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:32:53,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1961|]. (let ((.cse0 (select |v_#memory_int_1961| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_1961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:32:53,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,238 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1962|]. (let ((.cse0 (select |v_#memory_int_1962| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_1962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:32:53,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,272 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1963|]. (let ((.cse0 (select |v_#memory_int_1963| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_1963| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:53,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:32:53,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1964|]. (let ((.cse0 (select |v_#memory_int_1964| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1964| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:32:53,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:32:53,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1965|]. (let ((.cse0 (select |v_#memory_int_1965| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1965| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:32:53,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:32:53,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1966|]. (let ((.cse0 (select |v_#memory_int_1966| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1966| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:32:53,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:32:53,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1967|]. (let ((.cse0 (select |v_#memory_int_1967| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1967| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:32:53,367 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:32:53,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1968|]. (let ((.cse0 (select |v_#memory_int_1968| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1968| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:32:53,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:32:53,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1969|]. (let ((.cse0 (select |v_#memory_int_1969| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1969| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:32:53,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:32:53,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,447 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1970|]. (let ((.cse0 (select |v_#memory_int_1970| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_1970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:32:53,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1971|]. (let ((.cse0 (select |v_#memory_int_1971| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_1971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:32:53,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,509 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1972|]. (let ((.cse0 (select |v_#memory_int_1972| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_1972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:32:53,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,547 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1973|]. (let ((.cse0 (select |v_#memory_int_1973| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_1973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,547 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:32:53,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1974|]. (let ((.cse0 (select |v_#memory_int_1974| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_1974| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:32:53,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1975|]. (let ((.cse0 (select |v_#memory_int_1975| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1975| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:32:53,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:32:53,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1976|]. (let ((.cse0 (select |v_#memory_int_1976| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:32:53,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:32:53,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1977|]. (let ((.cse0 (select |v_#memory_int_1977| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1977| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:32:53,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:32:53,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1978|]. (let ((.cse0 (select |v_#memory_int_1978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:32:53,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:32:53,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1979|]. (let ((.cse0 (select |v_#memory_int_1979| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:32:53,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:32:53,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1980|]. (let ((.cse0 (select |v_#memory_int_1980| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_1980| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:32:53,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1981|]. (let ((.cse0 (select |v_#memory_int_1981| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_1981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:32:53,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,840 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,840 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1982|]. (let ((.cse0 (select |v_#memory_int_1982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:32:53,840 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:32:53,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,877 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1983|]. (let ((.cse0 (select |v_#memory_int_1983| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_1983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:32:53,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1984|]. (let ((.cse0 (select |v_#memory_int_1984| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_1984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:53,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:32:53,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1985|]. (let ((.cse0 (select |v_#memory_int_1985| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_1985| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:53,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:32:53,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:53,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:53,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:53,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:53,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:53,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1986|]. (let ((.cse0 (select |v_#memory_int_1986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:32:53,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:32:54,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1987|]. (let ((.cse0 (select |v_#memory_int_1987| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_1987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:32:54,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1988|]. (let ((.cse0 (select |v_#memory_int_1988| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_1988| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:32:54,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:32:54,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1989|]. (let ((.cse0 (select |v_#memory_int_1989| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= |#memory_int| (store |v_#memory_int_1989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:54,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:32:54,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1990|]. (let ((.cse0 (select |v_#memory_int_1990| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1990| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:32:54,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:32:54,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1991|]. (let ((.cse0 (select |v_#memory_int_1991| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_1991| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:32:54,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1992|]. (let ((.cse0 (select |v_#memory_int_1992| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:32:54,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:32:54,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1993|]. (let ((.cse0 (select |v_#memory_int_1993| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_1993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:32:54,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1994|]. (let ((.cse0 (select |v_#memory_int_1994| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_1994| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:32:54,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1995|]. (let ((.cse0 (select |v_#memory_int_1995| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:32:54,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:32:54,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1996|]. (let ((.cse0 (select |v_#memory_int_1996| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_1996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:32:54,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1997|]. (let ((.cse0 (select |v_#memory_int_1997| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:32:54,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:32:54,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,536 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1998|]. (let ((.cse0 (select |v_#memory_int_1998| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_1998| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:32:54,536 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:32:54,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_1999|]. (let ((.cse0 (select |v_#memory_int_1999| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_1999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:32:54,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2000|]. (let ((.cse0 (select |v_#memory_int_2000| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:32:54,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2001|]. (let ((.cse0 (select |v_#memory_int_2001| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2001| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 40 .cse0))) [2019-05-15 10:32:54,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:32:54,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2002|]. (let ((.cse0 (select |v_#memory_int_2002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:32:54,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:32:54,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2003|]. (let ((.cse0 (select |v_#memory_int_2003| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_2003| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:54,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:32:54,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2004|]. (let ((.cse0 (select |v_#memory_int_2004| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:32:54,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2005|]. (let ((.cse0 (select |v_#memory_int_2005| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:54,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:32:54,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:54,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:54,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:54,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:54,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:54,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2006|]. (let ((.cse0 (select |v_#memory_int_2006| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_2006| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:54,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:32:55,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,023 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2007|]. (let ((.cse0 (select |v_#memory_int_2007| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2007| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:55,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:32:55,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2008|]. (let ((.cse0 (select |v_#memory_int_2008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:32:55,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:32:55,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2009|]. (let ((.cse0 (select |v_#memory_int_2009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:32:55,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:32:55,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2010|]. (let ((.cse0 (select |v_#memory_int_2010| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2010| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:32:55,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:32:55,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,260 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2011|]. (let ((.cse0 (select |v_#memory_int_2011| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:55,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:32:55,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2012|]. (let ((.cse0 (select |v_#memory_int_2012| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:55,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:32:55,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2013|]. (let ((.cse0 (select |v_#memory_int_2013| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2013| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:32:55,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:32:55,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,448 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2014|]. (let ((.cse0 (select |v_#memory_int_2014| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:55,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:32:55,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2015|]. (let ((.cse0 (select |v_#memory_int_2015| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2015| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:32:55,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:32:55,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,578 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2016|]. (let ((.cse0 (select |v_#memory_int_2016| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= |#memory_int| (store |v_#memory_int_2016| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:55,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:32:55,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,642 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2017|]. (let ((.cse0 (select |v_#memory_int_2017| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:32:55,642 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:32:55,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2018|]. (let ((.cse0 (select |v_#memory_int_2018| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2018| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:32:55,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:32:55,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2019|]. (let ((.cse0 (select |v_#memory_int_2019| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:32:55,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:32:55,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2020|]. (let ((.cse0 (select |v_#memory_int_2020| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2020| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 59 .cse0))) [2019-05-15 10:32:55,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:32:55,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:55,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:55,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2021|]. (let ((.cse0 (select |v_#memory_int_2021| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:32:55,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:32:55,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:32:55,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:32:55,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:32:55,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:32:56,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:32:56,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2022|]. (let ((.cse0 (select |v_#memory_int_2022| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:32:56,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:32:56,052 INFO L273 TraceCheckUtils]: 0: Hoare triple {17498#true} havoc main_p1; {17498#true} is VALID [2019-05-15 10:32:56,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {17498#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {17498#true} is VALID [2019-05-15 10:32:56,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {17498#true} #memory_int := #memory_int[main_p1 := 0]; {17509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:32:56,053 INFO L273 TraceCheckUtils]: 3: Hoare triple {17509#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:32:56,054 INFO L273 TraceCheckUtils]: 4: Hoare triple {17513#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:32:56,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {17517#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:32:56,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {17521#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:32:56,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {17525#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:32:56,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {17529#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:32:56,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {17533#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:32:56,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {17537#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:32:56,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {17541#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:32:56,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {17545#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:32:56,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {17549#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:32:56,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {17553#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:32:56,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {17557#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:32:56,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {17561#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:32:56,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {17565#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:32:56,065 INFO L273 TraceCheckUtils]: 18: Hoare triple {17569#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:32:56,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {17573#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:32:56,067 INFO L273 TraceCheckUtils]: 20: Hoare triple {17577#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:32:56,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {17581#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:32:56,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {17585#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:32:56,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {17589#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:32:56,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {17593#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:32:56,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {17597#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:32:56,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {17601#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:32:56,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {17605#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:32:56,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {17609#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:32:56,074 INFO L273 TraceCheckUtils]: 29: Hoare triple {17613#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:32:56,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {17617#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:32:56,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {17621#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:32:56,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {17625#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:32:56,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {17629#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:32:56,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {17633#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:32:56,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {17637#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:32:56,080 INFO L273 TraceCheckUtils]: 36: Hoare triple {17641#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:32:56,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {17645#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:32:56,081 INFO L273 TraceCheckUtils]: 38: Hoare triple {17649#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:32:56,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {17653#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:32:56,083 INFO L273 TraceCheckUtils]: 40: Hoare triple {17657#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:32:56,083 INFO L273 TraceCheckUtils]: 41: Hoare triple {17661#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:32:56,084 INFO L273 TraceCheckUtils]: 42: Hoare triple {17665#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:32:56,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {17669#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:32:56,086 INFO L273 TraceCheckUtils]: 44: Hoare triple {17673#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:32:56,087 INFO L273 TraceCheckUtils]: 45: Hoare triple {17677#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17681#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:32:56,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {17681#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17685#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:32:56,088 INFO L273 TraceCheckUtils]: 47: Hoare triple {17685#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17689#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:32:56,089 INFO L273 TraceCheckUtils]: 48: Hoare triple {17689#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17693#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:32:56,090 INFO L273 TraceCheckUtils]: 49: Hoare triple {17693#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17697#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:32:56,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {17697#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17701#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:32:56,091 INFO L273 TraceCheckUtils]: 51: Hoare triple {17701#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17705#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:32:56,092 INFO L273 TraceCheckUtils]: 52: Hoare triple {17705#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17709#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:32:56,093 INFO L273 TraceCheckUtils]: 53: Hoare triple {17709#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17713#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:32:56,094 INFO L273 TraceCheckUtils]: 54: Hoare triple {17713#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17717#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:32:56,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {17717#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17721#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:32:56,095 INFO L273 TraceCheckUtils]: 56: Hoare triple {17721#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17725#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:32:56,096 INFO L273 TraceCheckUtils]: 57: Hoare triple {17725#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17729#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:32:56,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {17729#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17733#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:32:56,098 INFO L273 TraceCheckUtils]: 59: Hoare triple {17733#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17737#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:32:56,098 INFO L273 TraceCheckUtils]: 60: Hoare triple {17737#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17741#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:32:56,099 INFO L273 TraceCheckUtils]: 61: Hoare triple {17741#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17745#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:32:56,100 INFO L273 TraceCheckUtils]: 62: Hoare triple {17745#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17749#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:32:56,101 INFO L273 TraceCheckUtils]: 63: Hoare triple {17749#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17753#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:32:56,102 INFO L273 TraceCheckUtils]: 64: Hoare triple {17753#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {17757#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:32:56,102 INFO L273 TraceCheckUtils]: 65: Hoare triple {17757#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} assume !(#memory_int[main_p1] >= 0); {17499#false} is VALID [2019-05-15 10:32:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:32:56,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:32:56,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-15 10:32:56,110 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-05-15 10:32:56,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:32:56,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2019-05-15 10:32:56,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:32:56,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-05-15 10:32:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-15 10:32:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-05-15 10:32:56,163 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 65 states. [2019-05-15 10:33:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:04,600 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:04,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-15 10:33:04,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 66 [2019-05-15 10:33:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:33:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-05-15 10:33:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-05-15 10:33:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-05-15 10:33:04,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 69 transitions. [2019-05-15 10:33:04,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:04,658 INFO L225 Difference]: With dead ends: 68 [2019-05-15 10:33:04,658 INFO L226 Difference]: Without dead ends: 68 [2019-05-15 10:33:04,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-05-15 10:33:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-05-15 10:33:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-05-15 10:33:04,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:04,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:04,660 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:04,660 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:04,660 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:04,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:04,661 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:04,661 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2019-05-15 10:33:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:04,662 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-05-15 10:33:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:04,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:04,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:04,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:04,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:04,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-05-15 10:33:04,663 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-05-15 10:33:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:04,663 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-05-15 10:33:04,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-05-15 10:33:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-05-15 10:33:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-05-15 10:33:04,663 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:04,663 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-05-15 10:33:04,663 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 403672194, now seen corresponding path program 63 times [2019-05-15 10:33:04,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:04,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-15 10:33:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:04,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:04,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:33:04,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:04,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2023|]. (= |#memory_int| (store |v_#memory_int_2023| ULTIMATE.start_main_p1 0)) [2019-05-15 10:33:04,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:04,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2024|]. (let ((.cse0 (select |v_#memory_int_2024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:33:04,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:04,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2025|]. (let ((.cse0 (select |v_#memory_int_2025| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2025| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:33:04,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:04,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2026|]. (let ((.cse0 (select |v_#memory_int_2026| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2026| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:33:04,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:04,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,867 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2027|]. (let ((.cse0 (select |v_#memory_int_2027| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2027| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:33:04,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:04,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2028|]. (let ((.cse0 (select |v_#memory_int_2028| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_2028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:04,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:04,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,913 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2029|]. (let ((.cse0 (select |v_#memory_int_2029| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2029| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:04,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:04,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2030|]. (let ((.cse0 (select |v_#memory_int_2030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:33:04,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:04,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2031|]. (let ((.cse0 (select |v_#memory_int_2031| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:33:04,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:04,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:04,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:04,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:04,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:04,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:04,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2032|]. (let ((.cse0 (select |v_#memory_int_2032| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2032| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:04,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:05,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2033|]. (let ((.cse0 (select |v_#memory_int_2033| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2033| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:33:05,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:05,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2034|]. (let ((.cse0 (select |v_#memory_int_2034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:33:05,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:05,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,072 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2035|]. (let ((.cse0 (select |v_#memory_int_2035| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:05,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:05,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2036|]. (let ((.cse0 (select |v_#memory_int_2036| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:33:05,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:05,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2037|]. (let ((.cse0 (select |v_#memory_int_2037| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2037| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:33:05,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:05,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2038|]. (let ((.cse0 (select |v_#memory_int_2038| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2038| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:05,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:05,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,193 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2039|]. (let ((.cse0 (select |v_#memory_int_2039| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= |#memory_int| (store |v_#memory_int_2039| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,193 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:05,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2040|]. (let ((.cse0 (select |v_#memory_int_2040| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:33:05,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:05,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,258 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2041|]. (let ((.cse0 (select |v_#memory_int_2041| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:33:05,258 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:05,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,291 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,291 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2042|]. (let ((.cse0 (select |v_#memory_int_2042| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2042| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,291 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:05,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2043|]. (let ((.cse0 (select |v_#memory_int_2043| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2043| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:05,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:05,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,359 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2044|]. (let ((.cse0 (select |v_#memory_int_2044| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2044| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:05,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:05,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2045|]. (let ((.cse0 (select |v_#memory_int_2045| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:33:05,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:05,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2046|]. (let ((.cse0 (select |v_#memory_int_2046| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:33:05,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:05,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2047|]. (let ((.cse0 (select |v_#memory_int_2047| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2047| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:05,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2048|]. (let ((.cse0 (select |v_#memory_int_2048| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_2048| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:05,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,539 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2049|]. (let ((.cse0 (select |v_#memory_int_2049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:05,546 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:05,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,585 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2050|]. (let ((.cse0 (select |v_#memory_int_2050| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2050| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:33:05,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:05,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2051|]. (let ((.cse0 (select |v_#memory_int_2051| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:05,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:05,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2052|]. (let ((.cse0 (select |v_#memory_int_2052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:33:05,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:05,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,710 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,710 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2053|]. (let ((.cse0 (select |v_#memory_int_2053| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:05,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:05,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2054|]. (let ((.cse0 (select |v_#memory_int_2054| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2054| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:33:05,756 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:05,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2055|]. (let ((.cse0 (select |v_#memory_int_2055| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2055| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:05,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2056|]. (let ((.cse0 (select |v_#memory_int_2056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:33:05,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:05,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2057|]. (let ((.cse0 (select |v_#memory_int_2057| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:33:05,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:05,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:05,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:05,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:05,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:05,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:05,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2058|]. (let ((.cse0 (select |v_#memory_int_2058| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= |#memory_int| (store |v_#memory_int_2058| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:05,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:06,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2059|]. (let ((.cse0 (select |v_#memory_int_2059| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_2059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:06,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2060|]. (let ((.cse0 (select |v_#memory_int_2060| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_2060| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:06,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:06,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2061|]. (let ((.cse0 (select |v_#memory_int_2061| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_2061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:06,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,162 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2062|]. (let ((.cse0 (select |v_#memory_int_2062| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2062| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:33:06,162 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:06,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,213 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2063|]. (let ((.cse0 (select |v_#memory_int_2063| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:33:06,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:06,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2064|]. (let ((.cse0 (select |v_#memory_int_2064| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:33:06,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:06,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,322 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2065|]. (let ((.cse0 (select |v_#memory_int_2065| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_2065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:06,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2066|]. (let ((.cse0 (select |v_#memory_int_2066| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_2066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:06,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2067|]. (let ((.cse0 (select |v_#memory_int_2067| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:06,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,497 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2068|]. (let ((.cse0 (select |v_#memory_int_2068| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:33:06,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:06,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,553 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2069|]. (let ((.cse0 (select |v_#memory_int_2069| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2069| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:33:06,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:06,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2070|]. (let ((.cse0 (select |v_#memory_int_2070| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2070| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:33:06,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:06,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2071|]. (let ((.cse0 (select |v_#memory_int_2071| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:06,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,732 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2072|]. (let ((.cse0 (select |v_#memory_int_2072| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2072| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:06,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2073|]. (let ((.cse0 (select |v_#memory_int_2073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:33:06,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:06,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2074|]. (let ((.cse0 (select |v_#memory_int_2074| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_2074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:06,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2075|]. (let ((.cse0 (select |v_#memory_int_2075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:33:06,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:06,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:06,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:06,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:06,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:06,982 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:06,982 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2076|]. (let ((.cse0 (select |v_#memory_int_2076| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:06,982 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:07,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2077|]. (let ((.cse0 (select |v_#memory_int_2077| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:33:07,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:07,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2078|]. (let ((.cse0 (select |v_#memory_int_2078| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:07,111 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:07,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2079|]. (let ((.cse0 (select |v_#memory_int_2079| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:33:07,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:07,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,253 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,253 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2080|]. (let ((.cse0 (select |v_#memory_int_2080| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:33:07,253 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:07,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,319 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2081|]. (let ((.cse0 (select |v_#memory_int_2081| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2081| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:07,319 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:07,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2082|]. (let ((.cse0 (select |v_#memory_int_2082| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2082| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 58 .cse0))) [2019-05-15 10:33:07,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:07,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2083|]. (let ((.cse0 (select |v_#memory_int_2083| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= |#memory_int| (store |v_#memory_int_2083| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:07,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:07,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2084|]. (let ((.cse0 (select |v_#memory_int_2084| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:07,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:07,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2085|]. (let ((.cse0 (select |v_#memory_int_2085| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:33:07,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:07,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:07,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:07,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:07,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:07,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:07,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2086|]. (let ((.cse0 (select |v_#memory_int_2086| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:33:07,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:07,710 INFO L273 TraceCheckUtils]: 0: Hoare triple {18032#true} havoc main_p1; {18032#true} is VALID [2019-05-15 10:33:07,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {18032#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {18032#true} is VALID [2019-05-15 10:33:07,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {18032#true} #memory_int := #memory_int[main_p1 := 0]; {18043#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:07,712 INFO L273 TraceCheckUtils]: 3: Hoare triple {18043#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18047#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:07,713 INFO L273 TraceCheckUtils]: 4: Hoare triple {18047#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18051#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:07,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {18051#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18055#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:07,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {18055#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18059#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:07,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {18059#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18063#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:07,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {18063#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18067#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:07,716 INFO L273 TraceCheckUtils]: 9: Hoare triple {18067#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18071#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:07,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {18071#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18075#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:07,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {18075#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18079#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:07,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {18079#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18083#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:07,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {18083#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18087#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:07,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {18087#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18091#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:07,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {18091#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18095#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:07,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {18095#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18099#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:07,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {18099#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18103#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:07,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {18103#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18107#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:07,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {18107#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18111#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:07,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {18111#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18115#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:07,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {18115#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18119#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:07,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {18119#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18123#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:07,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {18123#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18127#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:07,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {18127#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18131#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:07,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {18131#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18135#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:07,729 INFO L273 TraceCheckUtils]: 26: Hoare triple {18135#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18139#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:07,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {18139#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18143#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:07,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {18143#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18147#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:07,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {18147#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18151#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:07,732 INFO L273 TraceCheckUtils]: 30: Hoare triple {18151#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18155#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:07,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {18155#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18159#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:07,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {18159#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18163#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:07,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {18163#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18167#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:07,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {18167#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18171#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:07,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {18171#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18175#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:07,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {18175#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18179#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:07,737 INFO L273 TraceCheckUtils]: 37: Hoare triple {18179#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18183#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:07,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {18183#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18187#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:07,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {18187#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18191#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:07,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {18191#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18195#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:07,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {18195#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18199#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:07,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {18199#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18203#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:07,742 INFO L273 TraceCheckUtils]: 43: Hoare triple {18203#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18207#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:07,743 INFO L273 TraceCheckUtils]: 44: Hoare triple {18207#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18211#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:07,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {18211#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18215#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:07,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {18215#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18219#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:07,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {18219#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18223#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:07,746 INFO L273 TraceCheckUtils]: 48: Hoare triple {18223#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18227#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:07,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {18227#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18231#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:07,747 INFO L273 TraceCheckUtils]: 50: Hoare triple {18231#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18235#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:07,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {18235#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18239#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:07,749 INFO L273 TraceCheckUtils]: 52: Hoare triple {18239#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18243#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:07,749 INFO L273 TraceCheckUtils]: 53: Hoare triple {18243#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18247#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:07,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {18247#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18251#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:07,751 INFO L273 TraceCheckUtils]: 55: Hoare triple {18251#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18255#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:07,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {18255#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18259#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:07,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {18259#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18263#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:07,753 INFO L273 TraceCheckUtils]: 58: Hoare triple {18263#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18267#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:07,754 INFO L273 TraceCheckUtils]: 59: Hoare triple {18267#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18271#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:07,755 INFO L273 TraceCheckUtils]: 60: Hoare triple {18271#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18275#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:07,755 INFO L273 TraceCheckUtils]: 61: Hoare triple {18275#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18279#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:07,756 INFO L273 TraceCheckUtils]: 62: Hoare triple {18279#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18283#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:07,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {18283#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18287#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:07,758 INFO L273 TraceCheckUtils]: 64: Hoare triple {18287#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18291#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:07,758 INFO L273 TraceCheckUtils]: 65: Hoare triple {18291#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18295#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:07,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {18295#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} assume !(#memory_int[main_p1] >= 0); {18033#false} is VALID [2019-05-15 10:33:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:07,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:07,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-15 10:33:07,767 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-05-15 10:33:07,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:07,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states. [2019-05-15 10:33:07,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:07,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-05-15 10:33:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-15 10:33:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:33:07,820 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 66 states. [2019-05-15 10:33:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:16,286 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-15 10:33:16,287 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 67 [2019-05-15 10:33:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:33:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:33:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-05-15 10:33:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-05-15 10:33:16,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2019-05-15 10:33:16,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:16,346 INFO L225 Difference]: With dead ends: 69 [2019-05-15 10:33:16,346 INFO L226 Difference]: Without dead ends: 69 [2019-05-15 10:33:16,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-05-15 10:33:16,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-05-15 10:33:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-05-15 10:33:16,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:16,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:16,349 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:16,349 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:16,349 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:16,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:16,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:16,350 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:16,350 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 69 states. [2019-05-15 10:33:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:16,351 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-05-15 10:33:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:16,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:16,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:16,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:16,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:33:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-05-15 10:33:16,353 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-05-15 10:33:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:16,353 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-05-15 10:33:16,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-05-15 10:33:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-05-15 10:33:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-05-15 10:33:16,353 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:16,353 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-05-15 10:33:16,354 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -371063928, now seen corresponding path program 64 times [2019-05-15 10:33:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:16,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-15 10:33:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:16,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:16,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:33:16,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:16,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,432 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2087|]. (= (store |v_#memory_int_2087| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:33:16,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:16,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2088|]. (let ((.cse0 (select |v_#memory_int_2088| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2088| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:16,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,481 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,481 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2089|]. (let ((.cse0 (select |v_#memory_int_2089| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,481 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:16,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2090|]. (let ((.cse0 (select |v_#memory_int_2090| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_2090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:16,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,527 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2091|]. (let ((.cse0 (select |v_#memory_int_2091| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2091| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:16,527 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:16,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2092|]. (let ((.cse0 (select |v_#memory_int_2092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:33:16,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:16,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,571 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2093|]. (let ((.cse0 (select |v_#memory_int_2093| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,571 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:16,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2094|]. (let ((.cse0 (select |v_#memory_int_2094| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:33:16,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:16,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2095|]. (let ((.cse0 (select |v_#memory_int_2095| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:33:16,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:16,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2096|]. (let ((.cse0 (select |v_#memory_int_2096| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2096| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:16,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:16,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,671 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,671 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2097|]. (let ((.cse0 (select |v_#memory_int_2097| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2097| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:33:16,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:16,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2098|]. (let ((.cse0 (select |v_#memory_int_2098| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:16,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2099|]. (let ((.cse0 (select |v_#memory_int_2099| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:33:16,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:16,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2100|]. (let ((.cse0 (select |v_#memory_int_2100| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_2100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:16,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2101|]. (let ((.cse0 (select |v_#memory_int_2101| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:16,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2102|]. (let ((.cse0 (select |v_#memory_int_2102| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:16,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:16,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2103|]. (let ((.cse0 (select |v_#memory_int_2103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:33:16,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:16,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2104|]. (let ((.cse0 (select |v_#memory_int_2104| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_2104| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:16,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:16,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2105|]. (let ((.cse0 (select |v_#memory_int_2105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:33:16,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:16,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,955 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2106|]. (let ((.cse0 (select |v_#memory_int_2106| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2106| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:33:16,955 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:16,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:16,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:16,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:16,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:16,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:16,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2107|]. (let ((.cse0 (select |v_#memory_int_2107| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2107| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:16,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:17,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2108|]. (let ((.cse0 (select |v_#memory_int_2108| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_2108| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:17,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:17,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2109|]. (let ((.cse0 (select |v_#memory_int_2109| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_2109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:17,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2110|]. (let ((.cse0 (select |v_#memory_int_2110| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:33:17,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:17,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2111|]. (let ((.cse0 (select |v_#memory_int_2111| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:17,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2112|]. (let ((.cse0 (select |v_#memory_int_2112| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2112| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:33:17,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:17,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2113|]. (let ((.cse0 (select |v_#memory_int_2113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:17,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:17,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2114|]. (let ((.cse0 (select |v_#memory_int_2114| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2114| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:33:17,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:17,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,297 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,297 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2115|]. (let ((.cse0 (select |v_#memory_int_2115| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,297 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:17,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2116|]. (let ((.cse0 (select |v_#memory_int_2116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:33:17,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:17,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,368 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2117|]. (let ((.cse0 (select |v_#memory_int_2117| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2117| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 29 .cse0))) [2019-05-15 10:33:17,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:17,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2118|]. (let ((.cse0 (select |v_#memory_int_2118| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2118| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:33:17,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:17,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2119|]. (let ((.cse0 (select |v_#memory_int_2119| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_2119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:17,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2120|]. (let ((.cse0 (select |v_#memory_int_2120| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_2120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:17,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2121|]. (let ((.cse0 (select |v_#memory_int_2121| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:17,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2122|]. (let ((.cse0 (select |v_#memory_int_2122| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:33:17,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:17,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2123|]. (let ((.cse0 (select |v_#memory_int_2123| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2123| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:33:17,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:17,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2124|]. (let ((.cse0 (select |v_#memory_int_2124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:33:17,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:17,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2125|]. (let ((.cse0 (select |v_#memory_int_2125| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_2125| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:17,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,817 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,817 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2126|]. (let ((.cse0 (select |v_#memory_int_2126| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:17,818 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:17,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,866 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2127|]. (let ((.cse0 (select |v_#memory_int_2127| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= |#memory_int| (store |v_#memory_int_2127| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:17,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:17,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2128|]. (let ((.cse0 (select |v_#memory_int_2128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:33:17,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:17,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:17,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:17,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:17,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:17,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:17,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2129|]. (let ((.cse0 (select |v_#memory_int_2129| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:33:17,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:18,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2130|]. (let ((.cse0 (select |v_#memory_int_2130| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:33:18,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:18,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2131|]. (let ((.cse0 (select |v_#memory_int_2131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:33:18,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:18,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,134 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,134 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2132|]. (let ((.cse0 (select |v_#memory_int_2132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:33:18,134 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:18,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2133|]. (let ((.cse0 (select |v_#memory_int_2133| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2133| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:33:18,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:18,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2134|]. (let ((.cse0 (select |v_#memory_int_2134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:33:18,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:18,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2135|]. (let ((.cse0 (select |v_#memory_int_2135| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_2135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:18,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:18,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2136|]. (let ((.cse0 (select |v_#memory_int_2136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:33:18,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:18,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2137|]. (let ((.cse0 (select |v_#memory_int_2137| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:33:18,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:18,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,478 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2138|]. (let ((.cse0 (select |v_#memory_int_2138| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2138| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:18,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:18,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,538 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,538 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2139|]. (let ((.cse0 (select |v_#memory_int_2139| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:33:18,538 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:18,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2140|]. (let ((.cse0 (select |v_#memory_int_2140| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2140| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:33:18,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:18,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2141|]. (let ((.cse0 (select |v_#memory_int_2141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:33:18,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:18,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2142|]. (let ((.cse0 (select |v_#memory_int_2142| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2142| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 54 .cse0))) [2019-05-15 10:33:18,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:18,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,829 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2143|]. (let ((.cse0 (select |v_#memory_int_2143| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:33:18,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:18,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2144|]. (let ((.cse0 (select |v_#memory_int_2144| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:18,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:18,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:18,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:18,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:18,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:18,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:18,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2145|]. (let ((.cse0 (select |v_#memory_int_2145| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2145| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:33:18,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:19,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2146|]. (let ((.cse0 (select |v_#memory_int_2146| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:19,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:19,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2147|]. (let ((.cse0 (select |v_#memory_int_2147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:33:19,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:19,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2148|]. (let ((.cse0 (select |v_#memory_int_2148| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:19,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:19,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2149|]. (let ((.cse0 (select |v_#memory_int_2149| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2149| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:19,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:19,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2150|]. (let ((.cse0 (select |v_#memory_int_2150| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2150| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:19,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:19,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:19,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:19,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:19,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:19,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:19,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2151|]. (let ((.cse0 (select |v_#memory_int_2151| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2151| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:19,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:19,442 INFO L273 TraceCheckUtils]: 0: Hoare triple {18574#true} havoc main_p1; {18574#true} is VALID [2019-05-15 10:33:19,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {18574#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {18574#true} is VALID [2019-05-15 10:33:19,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {18574#true} #memory_int := #memory_int[main_p1 := 0]; {18585#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:19,443 INFO L273 TraceCheckUtils]: 3: Hoare triple {18585#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18589#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:19,444 INFO L273 TraceCheckUtils]: 4: Hoare triple {18589#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18593#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:19,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {18593#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18597#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:19,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {18597#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18601#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:19,446 INFO L273 TraceCheckUtils]: 7: Hoare triple {18601#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18605#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:19,447 INFO L273 TraceCheckUtils]: 8: Hoare triple {18605#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18609#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:19,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {18609#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18613#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:19,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {18613#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18617#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:19,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {18617#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18621#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:19,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {18621#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18625#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:19,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {18625#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18629#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:19,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {18629#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18633#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:19,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {18633#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18637#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:19,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {18637#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18641#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:19,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {18641#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18645#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:19,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {18645#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18649#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:19,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {18649#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18653#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:19,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {18653#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18657#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:19,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {18657#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18661#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:19,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {18661#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18665#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:19,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {18665#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18669#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:19,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {18669#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18673#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:19,460 INFO L273 TraceCheckUtils]: 25: Hoare triple {18673#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18677#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:19,460 INFO L273 TraceCheckUtils]: 26: Hoare triple {18677#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18681#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:19,461 INFO L273 TraceCheckUtils]: 27: Hoare triple {18681#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18685#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:19,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {18685#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18689#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:19,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {18689#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18693#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:19,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {18693#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18697#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:19,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {18697#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18701#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:19,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {18701#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18705#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:19,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {18705#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18709#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:19,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {18709#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18713#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:19,467 INFO L273 TraceCheckUtils]: 35: Hoare triple {18713#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18717#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:19,468 INFO L273 TraceCheckUtils]: 36: Hoare triple {18717#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18721#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:19,469 INFO L273 TraceCheckUtils]: 37: Hoare triple {18721#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18725#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:19,469 INFO L273 TraceCheckUtils]: 38: Hoare triple {18725#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18729#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:19,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {18729#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18733#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:19,471 INFO L273 TraceCheckUtils]: 40: Hoare triple {18733#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18737#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:19,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {18737#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18741#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:19,472 INFO L273 TraceCheckUtils]: 42: Hoare triple {18741#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18745#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:19,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {18745#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18749#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:19,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {18749#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18753#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:19,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {18753#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18757#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:19,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {18757#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18761#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:19,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {18761#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18765#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:19,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {18765#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18769#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:19,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {18769#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18773#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:19,478 INFO L273 TraceCheckUtils]: 50: Hoare triple {18773#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18777#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:19,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {18777#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18781#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:19,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {18781#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18785#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:19,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {18785#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18789#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:19,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {18789#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18793#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:19,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {18793#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18797#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:19,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {18797#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18801#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:19,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {18801#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18805#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:19,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {18805#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18809#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:19,485 INFO L273 TraceCheckUtils]: 59: Hoare triple {18809#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18813#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:19,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {18813#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18817#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:19,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {18817#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18821#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:19,488 INFO L273 TraceCheckUtils]: 62: Hoare triple {18821#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18825#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:19,488 INFO L273 TraceCheckUtils]: 63: Hoare triple {18825#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18829#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:19,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {18829#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18833#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:19,490 INFO L273 TraceCheckUtils]: 65: Hoare triple {18833#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18837#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:19,491 INFO L273 TraceCheckUtils]: 66: Hoare triple {18837#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {18841#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:19,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {18841#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} assume !(#memory_int[main_p1] >= 0); {18575#false} is VALID [2019-05-15 10:33:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:19,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-15 10:33:19,498 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-05-15 10:33:19,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:19,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states. [2019-05-15 10:33:19,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:19,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-05-15 10:33:19,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-15 10:33:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-05-15 10:33:19,553 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 67 states. [2019-05-15 10:33:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:28,371 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:28,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-15 10:33:28,371 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 68 [2019-05-15 10:33:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:33:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-05-15 10:33:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-05-15 10:33:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-05-15 10:33:28,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2019-05-15 10:33:28,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:28,429 INFO L225 Difference]: With dead ends: 70 [2019-05-15 10:33:28,429 INFO L226 Difference]: Without dead ends: 70 [2019-05-15 10:33:28,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-05-15 10:33:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-05-15 10:33:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-05-15 10:33:28,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:28,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:28,431 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:28,431 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:28,432 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:28,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:28,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:28,433 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:28,433 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2019-05-15 10:33:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:28,433 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-05-15 10:33:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:28,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:28,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:28,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:28,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:33:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-05-15 10:33:28,435 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-05-15 10:33:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:28,435 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-05-15 10:33:28,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-05-15 10:33:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-05-15 10:33:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-05-15 10:33:28,436 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:28,436 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-05-15 10:33:28,436 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1381920066, now seen corresponding path program 65 times [2019-05-15 10:33:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:28,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-15 10:33:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:28,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:28,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:33:28,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:28,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2152|]. (= |#memory_int| (store |v_#memory_int_2152| ULTIMATE.start_main_p1 0)) [2019-05-15 10:33:28,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:28,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2153|]. (let ((.cse0 (select |v_#memory_int_2153| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:28,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,576 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,576 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2154|]. (let ((.cse0 (select |v_#memory_int_2154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:33:28,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:28,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2155|]. (let ((.cse0 (select |v_#memory_int_2155| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2155| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:33:28,598 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:28,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2156|]. (let ((.cse0 (select |v_#memory_int_2156| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_2156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:28,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:28,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2157|]. (let ((.cse0 (select |v_#memory_int_2157| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:33:28,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:28,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2158|]. (let ((.cse0 (select |v_#memory_int_2158| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:28,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2159|]. (let ((.cse0 (select |v_#memory_int_2159| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_2159| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:28,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:28,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2160|]. (let ((.cse0 (select |v_#memory_int_2160| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2160| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:28,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2161|]. (let ((.cse0 (select |v_#memory_int_2161| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:28,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2162|]. (let ((.cse0 (select |v_#memory_int_2162| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2162| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:33:28,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:28,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2163|]. (let ((.cse0 (select |v_#memory_int_2163| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:28,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2164|]. (let ((.cse0 (select |v_#memory_int_2164| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:28,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:28,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2165|]. (let ((.cse0 (select |v_#memory_int_2165| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_2165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:28,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:28,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2166|]. (let ((.cse0 (select |v_#memory_int_2166| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2166| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:33:28,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:28,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2167|]. (let ((.cse0 (select |v_#memory_int_2167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:33:28,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:28,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,947 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,957 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,957 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2168|]. (let ((.cse0 (select |v_#memory_int_2168| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:33:28,957 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:28,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:28,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:28,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:28,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:28,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:28,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2169|]. (let ((.cse0 (select |v_#memory_int_2169| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2169| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:33:28,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:29,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2170|]. (let ((.cse0 (select |v_#memory_int_2170| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,029 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:29,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2171|]. (let ((.cse0 (select |v_#memory_int_2171| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:33:29,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:29,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2172|]. (let ((.cse0 (select |v_#memory_int_2172| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= |#memory_int| (store |v_#memory_int_2172| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:29,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:29,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2173|]. (let ((.cse0 (select |v_#memory_int_2173| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2173| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:33:29,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:29,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2174|]. (let ((.cse0 (select |v_#memory_int_2174| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_2174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,168 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:29,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2175|]. (let ((.cse0 (select |v_#memory_int_2175| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2175| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:29,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:29,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,244 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2176|]. (let ((.cse0 (select |v_#memory_int_2176| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2176| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:29,244 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:29,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2177|]. (let ((.cse0 (select |v_#memory_int_2177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:33:29,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:29,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2178|]. (let ((.cse0 (select |v_#memory_int_2178| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 25 .cse0))) [2019-05-15 10:33:29,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:29,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,361 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,361 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2179|]. (let ((.cse0 (select |v_#memory_int_2179| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,361 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:29,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2180|]. (let ((.cse0 (select |v_#memory_int_2180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:33:29,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:29,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2181|]. (let ((.cse0 (select |v_#memory_int_2181| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:33:29,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:29,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2182|]. (let ((.cse0 (select |v_#memory_int_2182| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2182| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:33:29,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:29,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2183|]. (let ((.cse0 (select |v_#memory_int_2183| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2183| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:29,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:29,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2184|]. (let ((.cse0 (select |v_#memory_int_2184| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:29,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2185|]. (let ((.cse0 (select |v_#memory_int_2185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:33:29,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:29,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2186|]. (let ((.cse0 (select |v_#memory_int_2186| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2186| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 33 .cse0))) [2019-05-15 10:33:29,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:29,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2187|]. (let ((.cse0 (select |v_#memory_int_2187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:33:29,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:29,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,790 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2188|]. (let ((.cse0 (select |v_#memory_int_2188| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_2188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,790 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:29,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2189|]. (let ((.cse0 (select |v_#memory_int_2189| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:33:29,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:29,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2190|]. (let ((.cse0 (select |v_#memory_int_2190| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2190| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:33:29,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:29,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2191|]. (let ((.cse0 (select |v_#memory_int_2191| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2191| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:29,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:29,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:29,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:29,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:29,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:29,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:29,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2192|]. (let ((.cse0 (select |v_#memory_int_2192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:33:29,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:30,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2193|]. (let ((.cse0 (select |v_#memory_int_2193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:33:30,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:30,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2194|]. (let ((.cse0 (select |v_#memory_int_2194| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2194| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:33:30,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:30,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2195|]. (let ((.cse0 (select |v_#memory_int_2195| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:30,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2196|]. (let ((.cse0 (select |v_#memory_int_2196| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2196| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 43 .cse0))) [2019-05-15 10:33:30,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:30,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,255 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2197|]. (let ((.cse0 (select |v_#memory_int_2197| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2197| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:33:30,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:30,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,317 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2198|]. (let ((.cse0 (select |v_#memory_int_2198| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2198| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:33:30,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:30,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2199|]. (let ((.cse0 (select |v_#memory_int_2199| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2199| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:30,378 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:30,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2200|]. (let ((.cse0 (select |v_#memory_int_2200| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2200| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:30,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2201|]. (let ((.cse0 (select |v_#memory_int_2201| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_2201| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:30,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:30,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2202|]. (let ((.cse0 (select |v_#memory_int_2202| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:30,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2203|]. (let ((.cse0 (select |v_#memory_int_2203| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:30,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2204|]. (let ((.cse0 (select |v_#memory_int_2204| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2204| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:30,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2205|]. (let ((.cse0 (select |v_#memory_int_2205| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:30,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2206|]. (let ((.cse0 (select |v_#memory_int_2206| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2206| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:30,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,875 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,875 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2207|]. (let ((.cse0 (select |v_#memory_int_2207| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:33:30,875 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:30,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:30,938 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:30,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2208|]. (let ((.cse0 (select |v_#memory_int_2208| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:30,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:30,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:30,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:30,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:30,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2209|]. (let ((.cse0 (select |v_#memory_int_2209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:31,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:31,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2210|]. (let ((.cse0 (select |v_#memory_int_2210| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_2210| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:31,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:31,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,129 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2211|]. (let ((.cse0 (select |v_#memory_int_2211| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2211| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:31,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:31,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2212|]. (let ((.cse0 (select |v_#memory_int_2212| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_2212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:31,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:31,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2213|]. (let ((.cse0 (select |v_#memory_int_2213| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:31,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:31,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2214|]. (let ((.cse0 (select |v_#memory_int_2214| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:33:31,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:31,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2215|]. (let ((.cse0 (select |v_#memory_int_2215| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2215| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:33:31,410 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:31,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2216|]. (let ((.cse0 (select |v_#memory_int_2216| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2216| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 63 .cse0))) [2019-05-15 10:33:31,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:31,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:31,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:31,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:31,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:31,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:31,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2217|]. (let ((.cse0 (select |v_#memory_int_2217| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= (store |v_#memory_int_2217| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:31,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:33:31,608 INFO L273 TraceCheckUtils]: 0: Hoare triple {19124#true} havoc main_p1; {19124#true} is VALID [2019-05-15 10:33:31,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {19124#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {19124#true} is VALID [2019-05-15 10:33:31,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {19124#true} #memory_int := #memory_int[main_p1 := 0]; {19135#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:31,609 INFO L273 TraceCheckUtils]: 3: Hoare triple {19135#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19139#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:31,610 INFO L273 TraceCheckUtils]: 4: Hoare triple {19139#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19143#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:31,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {19143#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19147#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:31,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {19147#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19151#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:31,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {19151#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19155#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:31,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {19155#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19159#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:31,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {19159#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19163#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:31,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {19163#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19167#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:31,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {19167#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19171#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:31,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {19171#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19175#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:31,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {19175#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19179#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:31,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {19179#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19183#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:31,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {19183#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19187#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:31,617 INFO L273 TraceCheckUtils]: 16: Hoare triple {19187#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19191#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:31,618 INFO L273 TraceCheckUtils]: 17: Hoare triple {19191#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19195#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:31,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {19195#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19199#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:31,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {19199#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19203#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:31,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {19203#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19207#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:31,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {19207#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19211#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:31,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {19211#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19215#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:31,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {19215#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19219#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:31,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {19219#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19223#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:31,624 INFO L273 TraceCheckUtils]: 25: Hoare triple {19223#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19227#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:31,625 INFO L273 TraceCheckUtils]: 26: Hoare triple {19227#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19231#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:31,625 INFO L273 TraceCheckUtils]: 27: Hoare triple {19231#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19235#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:31,626 INFO L273 TraceCheckUtils]: 28: Hoare triple {19235#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19239#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:31,627 INFO L273 TraceCheckUtils]: 29: Hoare triple {19239#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19243#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:31,628 INFO L273 TraceCheckUtils]: 30: Hoare triple {19243#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19247#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:31,628 INFO L273 TraceCheckUtils]: 31: Hoare triple {19247#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19251#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:31,629 INFO L273 TraceCheckUtils]: 32: Hoare triple {19251#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19255#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:31,630 INFO L273 TraceCheckUtils]: 33: Hoare triple {19255#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19259#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:31,630 INFO L273 TraceCheckUtils]: 34: Hoare triple {19259#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19263#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:31,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {19263#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19267#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:31,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {19267#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19271#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:31,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {19271#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19275#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:31,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {19275#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19279#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:31,634 INFO L273 TraceCheckUtils]: 39: Hoare triple {19279#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19283#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:31,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {19283#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19287#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:31,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {19287#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19291#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:31,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {19291#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19295#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:31,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {19295#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19299#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:31,638 INFO L273 TraceCheckUtils]: 44: Hoare triple {19299#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19303#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:31,639 INFO L273 TraceCheckUtils]: 45: Hoare triple {19303#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19307#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:31,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {19307#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19311#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:31,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {19311#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19315#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:31,641 INFO L273 TraceCheckUtils]: 48: Hoare triple {19315#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19319#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:31,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {19319#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19323#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:31,643 INFO L273 TraceCheckUtils]: 50: Hoare triple {19323#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19327#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:31,643 INFO L273 TraceCheckUtils]: 51: Hoare triple {19327#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19331#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:31,644 INFO L273 TraceCheckUtils]: 52: Hoare triple {19331#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19335#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:31,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {19335#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19339#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:31,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {19339#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19343#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:31,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {19343#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19347#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:31,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {19347#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19351#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:31,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {19351#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19355#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:31,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {19355#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19359#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:31,649 INFO L273 TraceCheckUtils]: 59: Hoare triple {19359#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19363#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:31,650 INFO L273 TraceCheckUtils]: 60: Hoare triple {19363#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19367#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:31,651 INFO L273 TraceCheckUtils]: 61: Hoare triple {19367#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19371#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:31,652 INFO L273 TraceCheckUtils]: 62: Hoare triple {19371#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19375#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:31,652 INFO L273 TraceCheckUtils]: 63: Hoare triple {19375#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19379#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:31,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {19379#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19383#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:31,654 INFO L273 TraceCheckUtils]: 65: Hoare triple {19383#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19387#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:31,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {19387#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19391#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:31,655 INFO L273 TraceCheckUtils]: 67: Hoare triple {19391#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19395#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:33:31,656 INFO L273 TraceCheckUtils]: 68: Hoare triple {19395#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} assume !(#memory_int[main_p1] >= 0); {19125#false} is VALID [2019-05-15 10:33:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:31,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:31,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-15 10:33:31,664 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-05-15 10:33:31,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:31,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states. [2019-05-15 10:33:31,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:31,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-05-15 10:33:31,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-15 10:33:31,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:33:31,720 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 68 states. [2019-05-15 10:33:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:40,697 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-15 10:33:40,697 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 69 [2019-05-15 10:33:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:33:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-05-15 10:33:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-05-15 10:33:40,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2019-05-15 10:33:40,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:40,754 INFO L225 Difference]: With dead ends: 71 [2019-05-15 10:33:40,754 INFO L226 Difference]: Without dead ends: 71 [2019-05-15 10:33:40,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-05-15 10:33:40,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-05-15 10:33:40,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-05-15 10:33:40,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:40,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:40,757 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:40,757 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:40,758 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:40,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:40,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:40,758 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:40,758 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 71 states. [2019-05-15 10:33:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:40,759 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-05-15 10:33:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:40,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:40,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:40,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:40,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:33:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-05-15 10:33:40,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-05-15 10:33:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:40,761 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-05-15 10:33:40,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-05-15 10:33:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-05-15 10:33:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-05-15 10:33:40,762 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:40,762 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-05-15 10:33:40,762 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:40,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:40,762 INFO L82 PathProgramCache]: Analyzing trace with hash -110150968, now seen corresponding path program 66 times [2019-05-15 10:33:40,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:40,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-15 10:33:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:40,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:40,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:33:40,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:40,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2218|]. (= |#memory_int| (store |v_#memory_int_2218| ULTIMATE.start_main_p1 0)) [2019-05-15 10:33:40,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:40,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:40,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:40,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2219|]. (let ((.cse0 (select |v_#memory_int_2219| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:40,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:40,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:40,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:40,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2220|]. (let ((.cse0 (select |v_#memory_int_2220| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_2220| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:40,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:40,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:40,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:40,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2221|]. (let ((.cse0 (select |v_#memory_int_2221| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:33:40,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:40,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:40,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:40,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:40,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:40,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:40,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2222|]. (let ((.cse0 (select |v_#memory_int_2222| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2222| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:40,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:41,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,018 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2223|]. (let ((.cse0 (select |v_#memory_int_2223| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:33:41,018 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:41,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2224|]. (let ((.cse0 (select |v_#memory_int_2224| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2224| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:33:41,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:41,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,069 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2225|]. (let ((.cse0 (select |v_#memory_int_2225| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_2225| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,069 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:41,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2226|]. (let ((.cse0 (select |v_#memory_int_2226| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:41,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,123 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2227|]. (let ((.cse0 (select |v_#memory_int_2227| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= (store |v_#memory_int_2227| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:41,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2228|]. (let ((.cse0 (select |v_#memory_int_2228| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2228| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:33:41,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:41,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2229|]. (let ((.cse0 (select |v_#memory_int_2229| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_2229| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:41,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:41,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,203 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2230|]. (let ((.cse0 (select |v_#memory_int_2230| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2230| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:33:41,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:41,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,232 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2231|]. (let ((.cse0 (select |v_#memory_int_2231| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:33:41,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:41,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,263 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2232|]. (let ((.cse0 (select |v_#memory_int_2232| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2232| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:41,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2233|]. (let ((.cse0 (select |v_#memory_int_2233| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_2233| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:41,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2234|]. (let ((.cse0 (select |v_#memory_int_2234| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2234| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:33:41,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:41,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2235|]. (let ((.cse0 (select |v_#memory_int_2235| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_2235| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:41,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:41,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2236|]. (let ((.cse0 (select |v_#memory_int_2236| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:41,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2237|]. (let ((.cse0 (select |v_#memory_int_2237| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2237| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:41,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:41,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2238|]. (let ((.cse0 (select |v_#memory_int_2238| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2238| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:33:41,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:41,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2239|]. (let ((.cse0 (select |v_#memory_int_2239| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= |#memory_int| (store |v_#memory_int_2239| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:41,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:41,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2240|]. (let ((.cse0 (select |v_#memory_int_2240| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_2240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:41,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2241|]. (let ((.cse0 (select |v_#memory_int_2241| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_2241| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:41,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2242|]. (let ((.cse0 (select |v_#memory_int_2242| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:33:41,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:41,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2243|]. (let ((.cse0 (select |v_#memory_int_2243| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:41,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2244|]. (let ((.cse0 (select |v_#memory_int_2244| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_2244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:41,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2245|]. (let ((.cse0 (select |v_#memory_int_2245| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:41,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2246|]. (let ((.cse0 (select |v_#memory_int_2246| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2246| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:33:41,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:41,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2247|]. (let ((.cse0 (select |v_#memory_int_2247| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:41,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:41,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,867 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,874 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,874 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2248|]. (let ((.cse0 (select |v_#memory_int_2248| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2248| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:33:41,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:41,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,914 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2249|]. (let ((.cse0 (select |v_#memory_int_2249| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2249| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:33:41,914 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:41,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:41,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:41,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2250|]. (let ((.cse0 (select |v_#memory_int_2250| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2250| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:41,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:41,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:41,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:41,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:41,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,001 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,001 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2251|]. (let ((.cse0 (select |v_#memory_int_2251| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,001 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:42,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2252|]. (let ((.cse0 (select |v_#memory_int_2252| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2252| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:42,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2253|]. (let ((.cse0 (select |v_#memory_int_2253| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_2253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:42,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2254|]. (let ((.cse0 (select |v_#memory_int_2254| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_2254| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:42,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:42,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,197 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2255|]. (let ((.cse0 (select |v_#memory_int_2255| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2255| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:33:42,197 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:42,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,247 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2256|]. (let ((.cse0 (select |v_#memory_int_2256| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_2256| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:42,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2257|]. (let ((.cse0 (select |v_#memory_int_2257| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:42,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2258|]. (let ((.cse0 (select |v_#memory_int_2258| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:42,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,397 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2259|]. (let ((.cse0 (select |v_#memory_int_2259| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:42,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,449 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2260|]. (let ((.cse0 (select |v_#memory_int_2260| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2260| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:33:42,449 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:42,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2261|]. (let ((.cse0 (select |v_#memory_int_2261| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2261| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:33:42,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:42,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2262|]. (let ((.cse0 (select |v_#memory_int_2262| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2262| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:33:42,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:42,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2263|]. (let ((.cse0 (select |v_#memory_int_2263| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:42,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2264|]. (let ((.cse0 (select |v_#memory_int_2264| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_2264| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:42,670 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:42,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2265|]. (let ((.cse0 (select |v_#memory_int_2265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:33:42,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:42,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2266|]. (let ((.cse0 (select |v_#memory_int_2266| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_2266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:42,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:42,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,841 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,841 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2267|]. (let ((.cse0 (select |v_#memory_int_2267| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:33:42,841 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:42,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2268|]. (let ((.cse0 (select |v_#memory_int_2268| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2268| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 49 .cse0))) [2019-05-15 10:33:42,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:42,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:42,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:42,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:42,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:42,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:42,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2269|]. (let ((.cse0 (select |v_#memory_int_2269| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2269| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:33:42,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:43,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2270|]. (let ((.cse0 (select |v_#memory_int_2270| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= (store |v_#memory_int_2270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:43,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:43,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,080 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2271|]. (let ((.cse0 (select |v_#memory_int_2271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:33:43,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:43,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,147 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,147 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2272|]. (let ((.cse0 (select |v_#memory_int_2272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:33:43,147 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:43,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2273|]. (let ((.cse0 (select |v_#memory_int_2273| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2273| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:33:43,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:43,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2274|]. (let ((.cse0 (select |v_#memory_int_2274| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_2274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:43,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:43,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,340 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2275|]. (let ((.cse0 (select |v_#memory_int_2275| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_2275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:43,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:43,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2276|]. (let ((.cse0 (select |v_#memory_int_2276| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2276| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:33:43,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:43,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2277|]. (let ((.cse0 (select |v_#memory_int_2277| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2277| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:33:43,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:43,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2278|]. (let ((.cse0 (select |v_#memory_int_2278| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2278| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:43,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:43,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2279|]. (let ((.cse0 (select |v_#memory_int_2279| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_2279| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:43,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:43,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2280|]. (let ((.cse0 (select |v_#memory_int_2280| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:33:43,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:43,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,789 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2281|]. (let ((.cse0 (select |v_#memory_int_2281| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:33:43,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:43,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2282|]. (let ((.cse0 (select |v_#memory_int_2282| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= |#memory_int| (store |v_#memory_int_2282| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:43,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:43,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:43,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:43,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2283|]. (let ((.cse0 (select |v_#memory_int_2283| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2283| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:33:43,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:33:43,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:43,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:43,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:43,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:44,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:44,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2284|]. (let ((.cse0 (select |v_#memory_int_2284| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_2284| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:44,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:33:44,059 INFO L273 TraceCheckUtils]: 0: Hoare triple {19682#true} havoc main_p1; {19682#true} is VALID [2019-05-15 10:33:44,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {19682#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {19682#true} is VALID [2019-05-15 10:33:44,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {19682#true} #memory_int := #memory_int[main_p1 := 0]; {19693#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:44,061 INFO L273 TraceCheckUtils]: 3: Hoare triple {19693#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19697#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:44,062 INFO L273 TraceCheckUtils]: 4: Hoare triple {19697#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19701#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:44,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {19701#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19705#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:44,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {19705#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19709#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:44,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {19709#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19713#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:44,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {19713#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19717#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:44,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {19717#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19721#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:44,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {19721#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19725#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:44,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {19725#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19729#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:44,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {19729#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19733#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:44,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {19733#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19737#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:44,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {19737#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19741#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:44,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {19741#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19745#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:44,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {19745#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19749#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:44,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {19749#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19753#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:44,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {19753#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19757#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:44,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {19757#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19761#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:44,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {19761#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19765#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:44,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {19765#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19769#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:44,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {19769#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19773#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:44,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {19773#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19777#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:44,078 INFO L273 TraceCheckUtils]: 24: Hoare triple {19777#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19781#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:44,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {19781#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19785#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:44,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {19785#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19789#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:44,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {19789#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19793#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:44,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {19793#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19797#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:44,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {19797#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19801#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:44,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {19801#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19805#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:44,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {19805#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19809#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:44,084 INFO L273 TraceCheckUtils]: 32: Hoare triple {19809#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19813#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:44,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {19813#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19817#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:44,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {19817#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19821#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:44,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {19821#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19825#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:44,088 INFO L273 TraceCheckUtils]: 36: Hoare triple {19825#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19829#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:44,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {19829#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19833#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:44,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {19833#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19837#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:44,090 INFO L273 TraceCheckUtils]: 39: Hoare triple {19837#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19841#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:44,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {19841#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19845#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:44,092 INFO L273 TraceCheckUtils]: 41: Hoare triple {19845#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19849#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:44,092 INFO L273 TraceCheckUtils]: 42: Hoare triple {19849#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19853#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:44,093 INFO L273 TraceCheckUtils]: 43: Hoare triple {19853#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19857#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:44,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {19857#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19861#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:44,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {19861#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19865#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:44,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {19865#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19869#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:44,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {19869#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19873#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:44,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {19873#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19877#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:44,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {19877#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19881#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:44,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {19881#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19885#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:44,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {19885#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19889#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:44,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {19889#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19893#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:44,109 INFO L273 TraceCheckUtils]: 53: Hoare triple {19893#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19897#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:44,109 INFO L273 TraceCheckUtils]: 54: Hoare triple {19897#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19901#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:44,110 INFO L273 TraceCheckUtils]: 55: Hoare triple {19901#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19905#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:44,110 INFO L273 TraceCheckUtils]: 56: Hoare triple {19905#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19909#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:44,111 INFO L273 TraceCheckUtils]: 57: Hoare triple {19909#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19913#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:44,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {19913#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19917#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:44,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {19917#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19921#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:44,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {19921#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19925#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:44,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {19925#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19929#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:44,115 INFO L273 TraceCheckUtils]: 62: Hoare triple {19929#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19933#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:44,116 INFO L273 TraceCheckUtils]: 63: Hoare triple {19933#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19937#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:44,117 INFO L273 TraceCheckUtils]: 64: Hoare triple {19937#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19941#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:44,117 INFO L273 TraceCheckUtils]: 65: Hoare triple {19941#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19945#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:44,118 INFO L273 TraceCheckUtils]: 66: Hoare triple {19945#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19949#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:44,119 INFO L273 TraceCheckUtils]: 67: Hoare triple {19949#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19953#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:33:44,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {19953#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {19957#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:33:44,120 INFO L273 TraceCheckUtils]: 69: Hoare triple {19957#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} assume !(#memory_int[main_p1] >= 0); {19683#false} is VALID [2019-05-15 10:33:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-15 10:33:44,128 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-05-15 10:33:44,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:44,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states. [2019-05-15 10:33:44,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:44,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-05-15 10:33:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-15 10:33:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-05-15 10:33:44,185 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 69 states. [2019-05-15 10:33:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:53,505 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:33:53,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-15 10:33:53,506 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 70 [2019-05-15 10:33:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:33:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:33:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-05-15 10:33:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-05-15 10:33:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-05-15 10:33:53,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2019-05-15 10:33:53,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:53,565 INFO L225 Difference]: With dead ends: 72 [2019-05-15 10:33:53,565 INFO L226 Difference]: Without dead ends: 72 [2019-05-15 10:33:53,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-05-15 10:33:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-05-15 10:33:53,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-05-15 10:33:53,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:33:53,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2019-05-15 10:33:53,567 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2019-05-15 10:33:53,567 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2019-05-15 10:33:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:53,568 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:33:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:33:53,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:53,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:53,569 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2019-05-15 10:33:53,569 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2019-05-15 10:33:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:33:53,570 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-05-15 10:33:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:33:53,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:33:53,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:33:53,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:33:53,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:33:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:33:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-05-15 10:33:53,571 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-05-15 10:33:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:33:53,572 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-05-15 10:33:53,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-05-15 10:33:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-05-15 10:33:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-05-15 10:33:53,572 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:33:53,572 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-05-15 10:33:53,572 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:33:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:33:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash 880287234, now seen corresponding path program 67 times [2019-05-15 10:33:53,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:33:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:53,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-15 10:33:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:33:53,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:33:53,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:33:53,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:33:53,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2285|]. (= (store |v_#memory_int_2285| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:33:53,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:33:53,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2286|]. (let ((.cse0 (select |v_#memory_int_2286| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2286| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:53,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:33:53,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,789 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2287|]. (let ((.cse0 (select |v_#memory_int_2287| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2287| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:33:53,789 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:33:53,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2288|]. (let ((.cse0 (select |v_#memory_int_2288| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2288| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:33:53,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:33:53,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2289|]. (let ((.cse0 (select |v_#memory_int_2289| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2289| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:33:53,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:33:53,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2290|]. (let ((.cse0 (select |v_#memory_int_2290| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2290| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:33:53,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:33:53,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2291|]. (let ((.cse0 (select |v_#memory_int_2291| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_2291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:53,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:33:53,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,905 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,905 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2292|]. (let ((.cse0 (select |v_#memory_int_2292| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2292| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:33:53,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:33:53,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2293|]. (let ((.cse0 (select |v_#memory_int_2293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:33:53,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:33:53,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,956 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2294|]. (let ((.cse0 (select |v_#memory_int_2294| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:33:53,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:33:53,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:53,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:53,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:53,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:53,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:53,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2295|]. (let ((.cse0 (select |v_#memory_int_2295| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:33:53,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:33:54,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2296|]. (let ((.cse0 (select |v_#memory_int_2296| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2296| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:33:54,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:33:54,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2297|]. (let ((.cse0 (select |v_#memory_int_2297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:33:54,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:33:54,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,065 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,065 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2298|]. (let ((.cse0 (select |v_#memory_int_2298| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:33:54,066 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:33:54,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2299|]. (let ((.cse0 (select |v_#memory_int_2299| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_2299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:33:54,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2300|]. (let ((.cse0 (select |v_#memory_int_2300| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:33:54,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2301|]. (let ((.cse0 (select |v_#memory_int_2301| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2301| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:33:54,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:33:54,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2302|]. (let ((.cse0 (select |v_#memory_int_2302| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_2302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:33:54,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2303|]. (let ((.cse0 (select |v_#memory_int_2303| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2303| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:33:54,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2304|]. (let ((.cse0 (select |v_#memory_int_2304| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_2304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:33:54,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,290 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,290 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2305|]. (let ((.cse0 (select |v_#memory_int_2305| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2305| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:33:54,290 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:33:54,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2306|]. (let ((.cse0 (select |v_#memory_int_2306| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:33:54,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:33:54,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,359 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2307|]. (let ((.cse0 (select |v_#memory_int_2307| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_2307| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:54,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:33:54,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,396 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2308|]. (let ((.cse0 (select |v_#memory_int_2308| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2308| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:33:54,396 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:33:54,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,436 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,437 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2309|]. (let ((.cse0 (select |v_#memory_int_2309| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,437 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:33:54,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2310|]. (let ((.cse0 (select |v_#memory_int_2310| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:33:54,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:33:54,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,737 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,737 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2311|]. (let ((.cse0 (select |v_#memory_int_2311| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2311| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:33:54,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:33:54,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2312|]. (let ((.cse0 (select |v_#memory_int_2312| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2312| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:33:54,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:33:54,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2313|]. (let ((.cse0 (select |v_#memory_int_2313| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:33:54,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2314|]. (let ((.cse0 (select |v_#memory_int_2314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:33:54,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:33:54,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2315|]. (let ((.cse0 (select |v_#memory_int_2315| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2315| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:33:54,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2316|]. (let ((.cse0 (select |v_#memory_int_2316| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2316| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:54,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:33:54,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:54,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:54,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:54,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:54,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:54,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2317|]. (let ((.cse0 (select |v_#memory_int_2317| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= |#memory_int| (store |v_#memory_int_2317| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:54,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:33:55,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2318|]. (let ((.cse0 (select |v_#memory_int_2318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:33:55,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:33:55,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2319|]. (let ((.cse0 (select |v_#memory_int_2319| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:33:55,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:33:55,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2320|]. (let ((.cse0 (select |v_#memory_int_2320| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2320| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:33:55,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:33:55,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,174 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,174 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2321|]. (let ((.cse0 (select |v_#memory_int_2321| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2321| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:33:55,175 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:33:55,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2322|]. (let ((.cse0 (select |v_#memory_int_2322| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2322| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:55,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:33:55,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,271 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2323|]. (let ((.cse0 (select |v_#memory_int_2323| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:33:55,272 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:33:55,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2324|]. (let ((.cse0 (select |v_#memory_int_2324| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2324| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:33:55,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:33:55,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2325|]. (let ((.cse0 (select |v_#memory_int_2325| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:55,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:33:55,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2326|]. (let ((.cse0 (select |v_#memory_int_2326| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:33:55,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:33:55,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2327|]. (let ((.cse0 (select |v_#memory_int_2327| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2327| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:33:55,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:33:55,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2328|]. (let ((.cse0 (select |v_#memory_int_2328| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2328| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:55,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:33:55,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,585 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2329|]. (let ((.cse0 (select |v_#memory_int_2329| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_2329| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:55,585 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:33:55,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2330|]. (let ((.cse0 (select |v_#memory_int_2330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:33:55,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:33:55,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2331|]. (let ((.cse0 (select |v_#memory_int_2331| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:55,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:33:55,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2332|]. (let ((.cse0 (select |v_#memory_int_2332| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:33:55,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:33:55,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2333|]. (let ((.cse0 (select |v_#memory_int_2333| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2333| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:33:55,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:33:55,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,868 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,868 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2334|]. (let ((.cse0 (select |v_#memory_int_2334| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2334| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:33:55,868 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:33:55,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2335|]. (let ((.cse0 (select |v_#memory_int_2335| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_2335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:55,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:33:55,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:55,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:55,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:55,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:55,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:55,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2336|]. (let ((.cse0 (select |v_#memory_int_2336| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2336| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:33:55,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:33:56,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2337|]. (let ((.cse0 (select |v_#memory_int_2337| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:33:56,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:33:56,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2338|]. (let ((.cse0 (select |v_#memory_int_2338| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_2338| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:56,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:33:56,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2339|]. (let ((.cse0 (select |v_#memory_int_2339| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:33:56,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2340|]. (let ((.cse0 (select |v_#memory_int_2340| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:33:56,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,296 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,296 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2341|]. (let ((.cse0 (select |v_#memory_int_2341| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2341| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:56,296 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:33:56,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,363 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2342|]. (let ((.cse0 (select |v_#memory_int_2342| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:33:56,363 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:33:56,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2343|]. (let ((.cse0 (select |v_#memory_int_2343| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2343| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:33:56,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,493 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2344|]. (let ((.cse0 (select |v_#memory_int_2344| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,493 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:33:56,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,561 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2345|]. (let ((.cse0 (select |v_#memory_int_2345| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:33:56,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:33:56,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2346|]. (let ((.cse0 (select |v_#memory_int_2346| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2346| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:33:56,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:33:56,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,693 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2347|]. (let ((.cse0 (select |v_#memory_int_2347| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= |#memory_int| (store |v_#memory_int_2347| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:33:56,693 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:33:56,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2348|]. (let ((.cse0 (select |v_#memory_int_2348| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= (store |v_#memory_int_2348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:33:56,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,852 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2349|]. (let ((.cse0 (select |v_#memory_int_2349| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:56,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:33:56,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,921 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,921 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2350|]. (let ((.cse0 (select |v_#memory_int_2350| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:33:56,921 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:33:56,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:56,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:56,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:56,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:56,993 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:56,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2351|]. (let ((.cse0 (select |v_#memory_int_2351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:33:56,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:33:57,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:33:57,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:33:57,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:33:57,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:33:57,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:33:57,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:33:57,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2352|]. (let ((.cse0 (select |v_#memory_int_2352| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:33:57,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:33:57,118 INFO L273 TraceCheckUtils]: 0: Hoare triple {20248#true} havoc main_p1; {20248#true} is VALID [2019-05-15 10:33:57,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {20248#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {20248#true} is VALID [2019-05-15 10:33:57,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {20248#true} #memory_int := #memory_int[main_p1 := 0]; {20259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:33:57,119 INFO L273 TraceCheckUtils]: 3: Hoare triple {20259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:33:57,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {20263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:33:57,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {20267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:33:57,121 INFO L273 TraceCheckUtils]: 6: Hoare triple {20271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:33:57,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {20275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:33:57,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {20279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:33:57,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {20283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:33:57,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {20287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:33:57,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {20291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:33:57,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {20295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:33:57,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {20299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:33:57,127 INFO L273 TraceCheckUtils]: 14: Hoare triple {20303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:33:57,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {20307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:33:57,129 INFO L273 TraceCheckUtils]: 16: Hoare triple {20311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:33:57,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {20315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:33:57,130 INFO L273 TraceCheckUtils]: 18: Hoare triple {20319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:33:57,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {20323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:33:57,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {20327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:33:57,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {20331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:33:57,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {20335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:33:57,134 INFO L273 TraceCheckUtils]: 23: Hoare triple {20339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:33:57,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {20343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:33:57,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {20347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:33:57,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {20351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:33:57,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {20355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:33:57,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {20359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:33:57,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {20363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:33:57,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {20367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:33:57,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {20371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:33:57,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {20375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:33:57,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {20379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:33:57,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {20383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:33:57,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {20387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:33:57,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {20391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:33:57,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {20395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:33:57,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {20399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:33:57,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {20403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:33:57,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {20407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:33:57,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {20411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:33:57,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {20415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:33:57,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {20419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:33:57,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {20423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:33:57,151 INFO L273 TraceCheckUtils]: 45: Hoare triple {20427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:33:57,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {20431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:33:57,152 INFO L273 TraceCheckUtils]: 47: Hoare triple {20435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:33:57,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {20439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:33:57,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {20443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:33:57,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {20447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:33:57,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {20451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:33:57,156 INFO L273 TraceCheckUtils]: 52: Hoare triple {20455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:33:57,157 INFO L273 TraceCheckUtils]: 53: Hoare triple {20459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:33:57,157 INFO L273 TraceCheckUtils]: 54: Hoare triple {20463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:33:57,158 INFO L273 TraceCheckUtils]: 55: Hoare triple {20467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:33:57,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {20471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:33:57,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {20475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:33:57,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {20479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:33:57,161 INFO L273 TraceCheckUtils]: 59: Hoare triple {20483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:33:57,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {20487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:33:57,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {20491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:33:57,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {20495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:33:57,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {20499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:33:57,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {20503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:33:57,166 INFO L273 TraceCheckUtils]: 65: Hoare triple {20507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:33:57,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {20511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:33:57,167 INFO L273 TraceCheckUtils]: 67: Hoare triple {20515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:33:57,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {20519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:33:57,169 INFO L273 TraceCheckUtils]: 69: Hoare triple {20523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:33:57,169 INFO L273 TraceCheckUtils]: 70: Hoare triple {20527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} assume !(#memory_int[main_p1] >= 0); {20249#false} is VALID [2019-05-15 10:33:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:33:57,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:33:57,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-15 10:33:57,177 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-05-15 10:33:57,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:33:57,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2019-05-15 10:33:57,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:33:57,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-05-15 10:33:57,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-15 10:33:57,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:33:57,232 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 70 states. [2019-05-15 10:34:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:06,805 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-15 10:34:06,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 71 [2019-05-15 10:34:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:34:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:34:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-05-15 10:34:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-05-15 10:34:06,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2019-05-15 10:34:06,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:06,866 INFO L225 Difference]: With dead ends: 73 [2019-05-15 10:34:06,867 INFO L226 Difference]: Without dead ends: 73 [2019-05-15 10:34:06,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-05-15 10:34:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-05-15 10:34:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-05-15 10:34:06,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:06,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:06,869 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:06,869 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:06,870 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:06,870 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:06,870 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 73 states. [2019-05-15 10:34:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:06,871 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-05-15 10:34:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:06,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:06,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:06,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:06,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:34:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-05-15 10:34:06,872 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-05-15 10:34:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:06,872 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-05-15 10:34:06,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-05-15 10:34:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-05-15 10:34:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-05-15 10:34:06,873 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:06,873 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-05-15 10:34:06,873 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1519100424, now seen corresponding path program 68 times [2019-05-15 10:34:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:06,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-15 10:34:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:06,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:06,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:34:06,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:06,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2353|]. (= |#memory_int| (store |v_#memory_int_2353| ULTIMATE.start_main_p1 0)) [2019-05-15 10:34:06,971 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:06,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:06,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:06,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:06,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:06,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:06,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2354|]. (let ((.cse0 (select |v_#memory_int_2354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:34:06,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:07,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2355|]. (let ((.cse0 (select |v_#memory_int_2355| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_2355| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:07,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:07,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2356|]. (let ((.cse0 (select |v_#memory_int_2356| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2356| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 2))) [2019-05-15 10:34:07,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:07,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2357|]. (let ((.cse0 (select |v_#memory_int_2357| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_2357| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:07,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2358|]. (let ((.cse0 (select |v_#memory_int_2358| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2358| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:34:07,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:07,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2359|]. (let ((.cse0 (select |v_#memory_int_2359| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2359| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:34:07,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:07,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2360|]. (let ((.cse0 (select |v_#memory_int_2360| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:34:07,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:07,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,148 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,148 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2361|]. (let ((.cse0 (select |v_#memory_int_2361| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_2361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,148 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:07,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2362|]. (let ((.cse0 (select |v_#memory_int_2362| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2362| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:34:07,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:07,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2363|]. (let ((.cse0 (select |v_#memory_int_2363| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2363| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:07,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:07,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2364|]. (let ((.cse0 (select |v_#memory_int_2364| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2364| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:34:07,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:07,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2365|]. (let ((.cse0 (select |v_#memory_int_2365| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2365| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:34:07,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:07,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2366|]. (let ((.cse0 (select |v_#memory_int_2366| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_2366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:07,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2367|]. (let ((.cse0 (select |v_#memory_int_2367| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_2367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:07,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2368|]. (let ((.cse0 (select |v_#memory_int_2368| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_2368| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:07,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:07,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2369|]. (let ((.cse0 (select |v_#memory_int_2369| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:34:07,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:07,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,412 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,412 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2370|]. (let ((.cse0 (select |v_#memory_int_2370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:34:07,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:07,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,446 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,446 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2371|]. (let ((.cse0 (select |v_#memory_int_2371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:34:07,447 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:07,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2372|]. (let ((.cse0 (select |v_#memory_int_2372| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2372| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:34:07,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:07,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2373|]. (let ((.cse0 (select |v_#memory_int_2373| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2373| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:34:07,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:07,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2374|]. (let ((.cse0 (select |v_#memory_int_2374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:34:07,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:07,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2375|]. (let ((.cse0 (select |v_#memory_int_2375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:34:07,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:07,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,643 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2376|]. (let ((.cse0 (select |v_#memory_int_2376| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2376| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:07,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:07,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2377|]. (let ((.cse0 (select |v_#memory_int_2377| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:07,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2378|]. (let ((.cse0 (select |v_#memory_int_2378| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:07,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2379|]. (let ((.cse0 (select |v_#memory_int_2379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:34:07,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:07,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2380|]. (let ((.cse0 (select |v_#memory_int_2380| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:07,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,928 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2381|]. (let ((.cse0 (select |v_#memory_int_2381| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_2381| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:07,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:07,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:07,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:07,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:07,978 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:07,978 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2382|]. (let ((.cse0 (select |v_#memory_int_2382| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2382| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:07,978 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:08,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,021 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2383|]. (let ((.cse0 (select |v_#memory_int_2383| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2383| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:34:08,021 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:08,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2384|]. (let ((.cse0 (select |v_#memory_int_2384| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_2384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:08,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,107 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2385|]. (let ((.cse0 (select |v_#memory_int_2385| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_2385| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:08,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2386|]. (let ((.cse0 (select |v_#memory_int_2386| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,152 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:08,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2387|]. (let ((.cse0 (select |v_#memory_int_2387| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,200 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:08,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,247 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2388|]. (let ((.cse0 (select |v_#memory_int_2388| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:34:08,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:08,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,295 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2389|]. (let ((.cse0 (select |v_#memory_int_2389| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2389| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:34:08,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:08,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2390|]. (let ((.cse0 (select |v_#memory_int_2390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:34:08,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:08,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2391|]. (let ((.cse0 (select |v_#memory_int_2391| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_2391| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:08,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:08,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2392|]. (let ((.cse0 (select |v_#memory_int_2392| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:34:08,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:08,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2393|]. (let ((.cse0 (select |v_#memory_int_2393| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2393| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:08,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2394|]. (let ((.cse0 (select |v_#memory_int_2394| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:08,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2395|]. (let ((.cse0 (select |v_#memory_int_2395| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_2395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:08,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2396|]. (let ((.cse0 (select |v_#memory_int_2396| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2396| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:34:08,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:08,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2397|]. (let ((.cse0 (select |v_#memory_int_2397| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2397| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:34:08,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:08,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,746 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2398|]. (let ((.cse0 (select |v_#memory_int_2398| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,746 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:08,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2399|]. (let ((.cse0 (select |v_#memory_int_2399| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:08,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2400|]. (let ((.cse0 (select |v_#memory_int_2400| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_2400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:08,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:08,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2401|]. (let ((.cse0 (select |v_#memory_int_2401| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:08,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:08,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:08,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:08,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:08,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:08,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:08,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2402|]. (let ((.cse0 (select |v_#memory_int_2402| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2402| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:34:08,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:09,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2403|]. (let ((.cse0 (select |v_#memory_int_2403| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:09,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2404|]. (let ((.cse0 (select |v_#memory_int_2404| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2404| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:34:09,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:09,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2405|]. (let ((.cse0 (select |v_#memory_int_2405| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:34:09,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:09,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2406|]. (let ((.cse0 (select |v_#memory_int_2406| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:34:09,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:09,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2407|]. (let ((.cse0 (select |v_#memory_int_2407| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_2407| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:09,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2408|]. (let ((.cse0 (select |v_#memory_int_2408| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= |#memory_int| (store |v_#memory_int_2408| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:09,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:09,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2409|]. (let ((.cse0 (select |v_#memory_int_2409| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2409| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:09,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:09,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2410|]. (let ((.cse0 (select |v_#memory_int_2410| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2410| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:09,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2411|]. (let ((.cse0 (select |v_#memory_int_2411| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2411| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:09,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2412|]. (let ((.cse0 (select |v_#memory_int_2412| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:09,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2413|]. (let ((.cse0 (select |v_#memory_int_2413| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:09,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,728 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2414|]. (let ((.cse0 (select |v_#memory_int_2414| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,728 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:09,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2415|]. (let ((.cse0 (select |v_#memory_int_2415| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_2415| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:09,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:09,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2416|]. (let ((.cse0 (select |v_#memory_int_2416| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_2416| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:09,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:09,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:09,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:09,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:09,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:09,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:09,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2417|]. (let ((.cse0 (select |v_#memory_int_2417| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2417| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 63 .cse0))) [2019-05-15 10:34:09,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:10,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:10,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:10,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2418|]. (let ((.cse0 (select |v_#memory_int_2418| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:10,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:10,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:10,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:10,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2419|]. (let ((.cse0 (select |v_#memory_int_2419| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2419| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:10,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:10,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:10,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:10,164 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,165 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2420|]. (let ((.cse0 (select |v_#memory_int_2420| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:34:10,165 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:10,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:10,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:10,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:10,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:10,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:10,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2421|]. (let ((.cse0 (select |v_#memory_int_2421| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2421| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 67 .cse0))) [2019-05-15 10:34:10,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:10,297 INFO L273 TraceCheckUtils]: 0: Hoare triple {20822#true} havoc main_p1; {20822#true} is VALID [2019-05-15 10:34:10,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {20822#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {20822#true} is VALID [2019-05-15 10:34:10,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {20822#true} #memory_int := #memory_int[main_p1 := 0]; {20833#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:10,299 INFO L273 TraceCheckUtils]: 3: Hoare triple {20833#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20837#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:10,300 INFO L273 TraceCheckUtils]: 4: Hoare triple {20837#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20841#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:10,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {20841#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20845#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:10,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {20845#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20849#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:10,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {20849#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20853#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:10,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {20853#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20857#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:10,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {20857#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20861#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:10,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {20861#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20865#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:10,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {20865#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20869#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:10,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {20869#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20873#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:10,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {20873#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20877#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:10,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {20877#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20881#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:10,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {20881#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20885#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:10,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {20885#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20889#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:10,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {20889#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20893#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:10,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {20893#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20897#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:10,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {20897#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20901#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:10,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {20901#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20905#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:10,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {20905#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20909#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:10,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {20909#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20913#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:10,314 INFO L273 TraceCheckUtils]: 23: Hoare triple {20913#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20917#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:10,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {20917#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20921#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:10,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {20921#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20925#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:10,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {20925#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20929#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:10,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {20929#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20933#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:10,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {20933#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20937#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:10,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {20937#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20941#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:10,320 INFO L273 TraceCheckUtils]: 30: Hoare triple {20941#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20945#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:10,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {20945#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20949#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:10,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {20949#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20953#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:10,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {20953#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20957#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:10,323 INFO L273 TraceCheckUtils]: 34: Hoare triple {20957#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20961#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:10,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {20961#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20965#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:10,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {20965#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20969#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:10,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {20969#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20973#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:10,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {20973#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20977#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:10,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {20977#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20981#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:10,328 INFO L273 TraceCheckUtils]: 40: Hoare triple {20981#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20985#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:10,329 INFO L273 TraceCheckUtils]: 41: Hoare triple {20985#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20989#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:10,329 INFO L273 TraceCheckUtils]: 42: Hoare triple {20989#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20993#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:10,330 INFO L273 TraceCheckUtils]: 43: Hoare triple {20993#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {20997#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:10,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {20997#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21001#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:10,332 INFO L273 TraceCheckUtils]: 45: Hoare triple {21001#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21005#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:10,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {21005#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21009#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:10,333 INFO L273 TraceCheckUtils]: 47: Hoare triple {21009#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21013#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:10,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {21013#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21017#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:10,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {21017#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21021#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:10,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {21021#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21025#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:10,336 INFO L273 TraceCheckUtils]: 51: Hoare triple {21025#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21029#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:10,337 INFO L273 TraceCheckUtils]: 52: Hoare triple {21029#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21033#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:10,338 INFO L273 TraceCheckUtils]: 53: Hoare triple {21033#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21037#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:10,339 INFO L273 TraceCheckUtils]: 54: Hoare triple {21037#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21041#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:10,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {21041#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21045#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:10,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {21045#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21049#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:10,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {21049#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21053#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:10,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {21053#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21057#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:10,343 INFO L273 TraceCheckUtils]: 59: Hoare triple {21057#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21061#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:10,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {21061#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21065#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:10,345 INFO L273 TraceCheckUtils]: 61: Hoare triple {21065#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21069#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:10,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {21069#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21073#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:10,346 INFO L273 TraceCheckUtils]: 63: Hoare triple {21073#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21077#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:10,347 INFO L273 TraceCheckUtils]: 64: Hoare triple {21077#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21081#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:10,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {21081#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21085#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:10,348 INFO L273 TraceCheckUtils]: 66: Hoare triple {21085#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21089#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:10,349 INFO L273 TraceCheckUtils]: 67: Hoare triple {21089#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21093#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:10,350 INFO L273 TraceCheckUtils]: 68: Hoare triple {21093#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21097#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:10,351 INFO L273 TraceCheckUtils]: 69: Hoare triple {21097#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21101#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:10,366 INFO L273 TraceCheckUtils]: 70: Hoare triple {21101#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21105#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:10,366 INFO L273 TraceCheckUtils]: 71: Hoare triple {21105#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} assume !(#memory_int[main_p1] >= 0); {20823#false} is VALID [2019-05-15 10:34:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:10,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:10,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-15 10:34:10,373 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-05-15 10:34:10,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:10,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states. [2019-05-15 10:34:10,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:10,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-05-15 10:34:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-15 10:34:10,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-05-15 10:34:10,436 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 71 states. [2019-05-15 10:34:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:20,286 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:20,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-15 10:34:20,287 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 72 [2019-05-15 10:34:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:34:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-05-15 10:34:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-05-15 10:34:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-05-15 10:34:20,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2019-05-15 10:34:20,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:20,437 INFO L225 Difference]: With dead ends: 74 [2019-05-15 10:34:20,437 INFO L226 Difference]: Without dead ends: 74 [2019-05-15 10:34:20,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-05-15 10:34:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-05-15 10:34:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-05-15 10:34:20,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:20,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:20,440 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:20,441 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:20,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:20,441 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:20,442 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2019-05-15 10:34:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:20,442 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-05-15 10:34:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:20,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:20,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:20,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:20,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:34:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-05-15 10:34:20,444 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-05-15 10:34:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:20,444 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-05-15 10:34:20,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-05-15 10:34:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-05-15 10:34:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-05-15 10:34:20,445 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:20,445 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-05-15 10:34:20,445 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:20,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash -152527166, now seen corresponding path program 69 times [2019-05-15 10:34:20,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:20,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-15 10:34:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:20,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:20,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:34:20,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:20,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2422|]. (= |#memory_int| (store |v_#memory_int_2422| ULTIMATE.start_main_p1 0)) [2019-05-15 10:34:20,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:20,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,849 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2423|]. (let ((.cse0 (select |v_#memory_int_2423| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2423| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:34:20,849 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:20,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,869 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2424|]. (let ((.cse0 (select |v_#memory_int_2424| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:34:20,869 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:20,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2425|]. (let ((.cse0 (select |v_#memory_int_2425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:34:20,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:20,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,913 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,913 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2426|]. (let ((.cse0 (select |v_#memory_int_2426| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_2426| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:20,913 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:20,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2427|]. (let ((.cse0 (select |v_#memory_int_2427| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_2427| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:20,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:20,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2428|]. (let ((.cse0 (select |v_#memory_int_2428| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2428| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:20,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:20,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:20,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:20,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:20,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:20,984 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2429|]. (let ((.cse0 (select |v_#memory_int_2429| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= (store |v_#memory_int_2429| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:20,984 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:20,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:20,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2430|]. (let ((.cse0 (select |v_#memory_int_2430| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2430| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:21,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2431|]. (let ((.cse0 (select |v_#memory_int_2431| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_2431| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:21,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2432|]. (let ((.cse0 (select |v_#memory_int_2432| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2432| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:21,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:21,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2433|]. (let ((.cse0 (select |v_#memory_int_2433| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:34:21,088 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:21,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2434|]. (let ((.cse0 (select |v_#memory_int_2434| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:21,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,146 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,146 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2435|]. (let ((.cse0 (select |v_#memory_int_2435| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:34:21,146 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:21,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2436|]. (let ((.cse0 (select |v_#memory_int_2436| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_2436| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:21,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:21,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,206 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,206 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2437|]. (let ((.cse0 (select |v_#memory_int_2437| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2437| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:34:21,206 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:21,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,238 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2438|]. (let ((.cse0 (select |v_#memory_int_2438| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2438| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:34:21,238 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:21,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2439|]. (let ((.cse0 (select |v_#memory_int_2439| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:21,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2440|]. (let ((.cse0 (select |v_#memory_int_2440| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:21,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2441|]. (let ((.cse0 (select |v_#memory_int_2441| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:34:21,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:21,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2442|]. (let ((.cse0 (select |v_#memory_int_2442| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_2442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:21,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2443|]. (let ((.cse0 (select |v_#memory_int_2443| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:21,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2444|]. (let ((.cse0 (select |v_#memory_int_2444| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2444| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:34:21,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:21,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2445|]. (let ((.cse0 (select |v_#memory_int_2445| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= |#memory_int| (store |v_#memory_int_2445| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:21,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:21,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2446|]. (let ((.cse0 (select |v_#memory_int_2446| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2446| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:34:21,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:21,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2447|]. (let ((.cse0 (select |v_#memory_int_2447| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:34:21,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:21,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,591 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2448|]. (let ((.cse0 (select |v_#memory_int_2448| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_2448| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:21,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2449|]. (let ((.cse0 (select |v_#memory_int_2449| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2449| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:34:21,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:21,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2450|]. (let ((.cse0 (select |v_#memory_int_2450| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:34:21,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:21,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2451|]. (let ((.cse0 (select |v_#memory_int_2451| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_2451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:21,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,756 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2452|]. (let ((.cse0 (select |v_#memory_int_2452| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:21,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2453|]. (let ((.cse0 (select |v_#memory_int_2453| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2453| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:34:21,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:21,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2454|]. (let ((.cse0 (select |v_#memory_int_2454| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:34:21,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:21,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,895 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2455|]. (let ((.cse0 (select |v_#memory_int_2455| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:21,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:21,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2456|]. (let ((.cse0 (select |v_#memory_int_2456| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_2456| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:21,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:21,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:21,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:21,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:21,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:21,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:21,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2457|]. (let ((.cse0 (select |v_#memory_int_2457| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2457| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:34:21,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:22,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2458|]. (let ((.cse0 (select |v_#memory_int_2458| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_2458| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:22,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:22,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,080 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2459|]. (let ((.cse0 (select |v_#memory_int_2459| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,080 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:22,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2460|]. (let ((.cse0 (select |v_#memory_int_2460| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2460| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:34:22,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:22,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,177 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2461|]. (let ((.cse0 (select |v_#memory_int_2461| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2461| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:22,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2462|]. (let ((.cse0 (select |v_#memory_int_2462| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2462| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:22,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2463|]. (let ((.cse0 (select |v_#memory_int_2463| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:22,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2464|]. (let ((.cse0 (select |v_#memory_int_2464| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2464| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:22,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:22,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2465|]. (let ((.cse0 (select |v_#memory_int_2465| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2465| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:22,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,440 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2466|]. (let ((.cse0 (select |v_#memory_int_2466| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:34:22,440 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:22,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2467|]. (let ((.cse0 (select |v_#memory_int_2467| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:34:22,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:22,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,548 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2468|]. (let ((.cse0 (select |v_#memory_int_2468| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:22,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2469|]. (let ((.cse0 (select |v_#memory_int_2469| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:22,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:22,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,660 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2470|]. (let ((.cse0 (select |v_#memory_int_2470| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:34:22,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:22,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2471|]. (let ((.cse0 (select |v_#memory_int_2471| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= |#memory_int| (store |v_#memory_int_2471| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:22,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:22,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2472|]. (let ((.cse0 (select |v_#memory_int_2472| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:34:22,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:22,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2473|]. (let ((.cse0 (select |v_#memory_int_2473| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2473| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 50))) [2019-05-15 10:34:22,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:22,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2474|]. (let ((.cse0 (select |v_#memory_int_2474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:34:22,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:22,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:22,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:22,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:22,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:22,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:22,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2475|]. (let ((.cse0 (select |v_#memory_int_2475| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2475| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:34:22,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:23,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2476|]. (let ((.cse0 (select |v_#memory_int_2476| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:23,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2477|]. (let ((.cse0 (select |v_#memory_int_2477| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:23,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2478|]. (let ((.cse0 (select |v_#memory_int_2478| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:23,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2479|]. (let ((.cse0 (select |v_#memory_int_2479| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2479| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:34:23,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:23,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2480|]. (let ((.cse0 (select |v_#memory_int_2480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:34:23,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:23,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2481|]. (let ((.cse0 (select |v_#memory_int_2481| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:34:23,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:23,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,417 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,417 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2482|]. (let ((.cse0 (select |v_#memory_int_2482| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2482| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:34:23,417 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:23,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2483|]. (let ((.cse0 (select |v_#memory_int_2483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:34:23,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:23,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2484|]. (let ((.cse0 (select |v_#memory_int_2484| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2484| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:23,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:23,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2485|]. (let ((.cse0 (select |v_#memory_int_2485| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:23,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,707 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2486|]. (let ((.cse0 (select |v_#memory_int_2486| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2486| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,707 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:23,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2487|]. (let ((.cse0 (select |v_#memory_int_2487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:23,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:23,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2488|]. (let ((.cse0 (select |v_#memory_int_2488| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:23,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2489|]. (let ((.cse0 (select |v_#memory_int_2489| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2489| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:23,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:23,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:23,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:23,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:23,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:23,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:23,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2490|]. (let ((.cse0 (select |v_#memory_int_2490| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:34:23,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:24,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:24,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:24,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:24,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:24,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:24,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:24,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2491|]. (let ((.cse0 (select |v_#memory_int_2491| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:24,057 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:34:24,113 INFO L273 TraceCheckUtils]: 0: Hoare triple {21404#true} havoc main_p1; {21404#true} is VALID [2019-05-15 10:34:24,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {21404#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {21404#true} is VALID [2019-05-15 10:34:24,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {21404#true} #memory_int := #memory_int[main_p1 := 0]; {21415#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:24,115 INFO L273 TraceCheckUtils]: 3: Hoare triple {21415#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21419#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:24,115 INFO L273 TraceCheckUtils]: 4: Hoare triple {21419#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21423#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:24,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {21423#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21427#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:24,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {21427#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21431#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:24,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {21431#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21435#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:24,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {21435#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21439#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:24,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {21439#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21443#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:24,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {21443#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21447#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:24,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {21447#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21451#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:24,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {21451#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21455#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:24,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {21455#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21459#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:24,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {21459#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21463#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:24,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {21463#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21467#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:24,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {21467#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21471#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:24,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {21471#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21475#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:24,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {21475#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21479#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:24,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {21479#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21483#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:24,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {21483#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21487#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:24,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {21487#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21491#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:24,129 INFO L273 TraceCheckUtils]: 22: Hoare triple {21491#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21495#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:24,130 INFO L273 TraceCheckUtils]: 23: Hoare triple {21495#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21499#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:24,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {21499#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21503#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:24,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {21503#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21507#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:24,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {21507#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21511#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:24,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {21511#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21515#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:24,133 INFO L273 TraceCheckUtils]: 28: Hoare triple {21515#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21519#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:24,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {21519#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21523#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:24,135 INFO L273 TraceCheckUtils]: 30: Hoare triple {21523#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21527#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:24,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {21527#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21531#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:24,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {21531#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21535#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:24,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {21535#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21539#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:24,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {21539#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21543#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:24,139 INFO L273 TraceCheckUtils]: 35: Hoare triple {21543#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21547#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:24,139 INFO L273 TraceCheckUtils]: 36: Hoare triple {21547#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21551#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:24,140 INFO L273 TraceCheckUtils]: 37: Hoare triple {21551#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21555#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:24,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {21555#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21559#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:24,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {21559#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21563#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:24,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {21563#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21567#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:24,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {21567#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21571#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:24,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {21571#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21575#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:24,145 INFO L273 TraceCheckUtils]: 43: Hoare triple {21575#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21579#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:24,145 INFO L273 TraceCheckUtils]: 44: Hoare triple {21579#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21583#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:24,146 INFO L273 TraceCheckUtils]: 45: Hoare triple {21583#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21587#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:24,147 INFO L273 TraceCheckUtils]: 46: Hoare triple {21587#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21591#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:24,148 INFO L273 TraceCheckUtils]: 47: Hoare triple {21591#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21595#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:24,148 INFO L273 TraceCheckUtils]: 48: Hoare triple {21595#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21599#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:24,149 INFO L273 TraceCheckUtils]: 49: Hoare triple {21599#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21603#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:24,150 INFO L273 TraceCheckUtils]: 50: Hoare triple {21603#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21607#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:24,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {21607#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21611#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:24,151 INFO L273 TraceCheckUtils]: 52: Hoare triple {21611#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21615#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:24,152 INFO L273 TraceCheckUtils]: 53: Hoare triple {21615#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21619#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:24,153 INFO L273 TraceCheckUtils]: 54: Hoare triple {21619#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21623#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:24,154 INFO L273 TraceCheckUtils]: 55: Hoare triple {21623#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21627#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:24,154 INFO L273 TraceCheckUtils]: 56: Hoare triple {21627#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21631#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:24,155 INFO L273 TraceCheckUtils]: 57: Hoare triple {21631#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21635#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:24,156 INFO L273 TraceCheckUtils]: 58: Hoare triple {21635#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21639#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:24,157 INFO L273 TraceCheckUtils]: 59: Hoare triple {21639#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21643#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:24,157 INFO L273 TraceCheckUtils]: 60: Hoare triple {21643#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21647#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:24,158 INFO L273 TraceCheckUtils]: 61: Hoare triple {21647#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21651#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:24,159 INFO L273 TraceCheckUtils]: 62: Hoare triple {21651#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21655#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:24,160 INFO L273 TraceCheckUtils]: 63: Hoare triple {21655#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21659#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:24,160 INFO L273 TraceCheckUtils]: 64: Hoare triple {21659#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21663#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:24,161 INFO L273 TraceCheckUtils]: 65: Hoare triple {21663#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21667#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:24,164 INFO L273 TraceCheckUtils]: 66: Hoare triple {21667#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21671#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:24,164 INFO L273 TraceCheckUtils]: 67: Hoare triple {21671#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21675#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:24,165 INFO L273 TraceCheckUtils]: 68: Hoare triple {21675#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21679#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:24,165 INFO L273 TraceCheckUtils]: 69: Hoare triple {21679#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21683#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:24,166 INFO L273 TraceCheckUtils]: 70: Hoare triple {21683#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21687#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:24,166 INFO L273 TraceCheckUtils]: 71: Hoare triple {21687#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {21691#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:34:24,167 INFO L273 TraceCheckUtils]: 72: Hoare triple {21691#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} assume !(#memory_int[main_p1] >= 0); {21405#false} is VALID [2019-05-15 10:34:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:24,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:24,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-15 10:34:24,175 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-05-15 10:34:24,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:24,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states. [2019-05-15 10:34:24,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:24,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-05-15 10:34:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-15 10:34:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:34:24,234 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 72 states. [2019-05-15 10:34:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:34,435 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-15 10:34:34,436 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 73 [2019-05-15 10:34:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-05-15 10:34:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-05-15 10:34:34,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2019-05-15 10:34:34,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:34,507 INFO L225 Difference]: With dead ends: 75 [2019-05-15 10:34:34,507 INFO L226 Difference]: Without dead ends: 75 [2019-05-15 10:34:34,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-05-15 10:34:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-05-15 10:34:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-05-15 10:34:34,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:34,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:34,509 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:34,509 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:34,510 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:34,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:34,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:34,511 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:34,511 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2019-05-15 10:34:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:34,512 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-05-15 10:34:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:34,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:34,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:34,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:34,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:34:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-05-15 10:34:34,513 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-05-15 10:34:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:34,514 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-05-15 10:34:34,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-05-15 10:34:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-05-15 10:34:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-05-15 10:34:34,514 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:34,514 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-05-15 10:34:34,515 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash -433374904, now seen corresponding path program 70 times [2019-05-15 10:34:34,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:34,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-15 10:34:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:34,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:34,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:34:34,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:34,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2492|]. (= (store |v_#memory_int_2492| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:34:34,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:34,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2493|]. (let ((.cse0 (select |v_#memory_int_2493| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_2493| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:34,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:34,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2494|]. (let ((.cse0 (select |v_#memory_int_2494| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_2494| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:34,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:34,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,673 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,673 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2495|]. (let ((.cse0 (select |v_#memory_int_2495| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:34:34,673 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:34,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2496|]. (let ((.cse0 (select |v_#memory_int_2496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 3 .cse0))) [2019-05-15 10:34:34,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:34,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,721 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2497|]. (let ((.cse0 (select |v_#memory_int_2497| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_2497| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:34,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:34,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2498|]. (let ((.cse0 (select |v_#memory_int_2498| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_2498| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:34,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:34,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2499|]. (let ((.cse0 (select |v_#memory_int_2499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:34:34,769 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:34,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,793 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2500|]. (let ((.cse0 (select |v_#memory_int_2500| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:34:34,793 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:34,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,854 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,854 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2501|]. (let ((.cse0 (select |v_#memory_int_2501| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2501| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:34:34,854 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:34,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2502|]. (let ((.cse0 (select |v_#memory_int_2502| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2502| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:34:34,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:34,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2503|]. (let ((.cse0 (select |v_#memory_int_2503| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:34,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:34,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2504|]. (let ((.cse0 (select |v_#memory_int_2504| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2504| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:34:34,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:34,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:34,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:34,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:34,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:34,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2505|]. (let ((.cse0 (select |v_#memory_int_2505| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= |#memory_int| (store |v_#memory_int_2505| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:34,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:34,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:34,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2506|]. (let ((.cse0 (select |v_#memory_int_2506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:34:35,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:35,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,038 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2507|]. (let ((.cse0 (select |v_#memory_int_2507| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2507| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,038 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:35,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,068 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2508|]. (let ((.cse0 (select |v_#memory_int_2508| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:34:35,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:35,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2509|]. (let ((.cse0 (select |v_#memory_int_2509| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2509| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:35,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2510|]. (let ((.cse0 (select |v_#memory_int_2510| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2510| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:35,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,171 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2511|]. (let ((.cse0 (select |v_#memory_int_2511| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_2511| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:35,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,203 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2512|]. (let ((.cse0 (select |v_#memory_int_2512| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2512| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:34:35,203 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:35,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2513|]. (let ((.cse0 (select |v_#memory_int_2513| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:34:35,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:35,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,273 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2514|]. (let ((.cse0 (select |v_#memory_int_2514| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_2514| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:35,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:35,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,311 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2515|]. (let ((.cse0 (select |v_#memory_int_2515| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_2515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,311 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:35,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2516|]. (let ((.cse0 (select |v_#memory_int_2516| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2516| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:34:35,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:35,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2517|]. (let ((.cse0 (select |v_#memory_int_2517| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2517| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 24))) [2019-05-15 10:34:35,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:35,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2518|]. (let ((.cse0 (select |v_#memory_int_2518| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_2518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,432 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:35,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2519|]. (let ((.cse0 (select |v_#memory_int_2519| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:35,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2520|]. (let ((.cse0 (select |v_#memory_int_2520| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2520| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:34:35,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:35,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2521|]. (let ((.cse0 (select |v_#memory_int_2521| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2521| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:34:35,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:35,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2522|]. (let ((.cse0 (select |v_#memory_int_2522| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_2522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:35,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,649 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2523|]. (let ((.cse0 (select |v_#memory_int_2523| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:35,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2524|]. (let ((.cse0 (select |v_#memory_int_2524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:34:35,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:35,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,740 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2525|]. (let ((.cse0 (select |v_#memory_int_2525| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 32))) [2019-05-15 10:34:35,740 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:35,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,788 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,788 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2526|]. (let ((.cse0 (select |v_#memory_int_2526| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:34:35,788 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:35,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2527|]. (let ((.cse0 (select |v_#memory_int_2527| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_2527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:35,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:35,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2528|]. (let ((.cse0 (select |v_#memory_int_2528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:34:35,881 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:35,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,930 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,930 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2529|]. (let ((.cse0 (select |v_#memory_int_2529| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:34:35,930 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:35,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:35,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:35,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:35,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:35,979 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:35,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2530|]. (let ((.cse0 (select |v_#memory_int_2530| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2530| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 37))) [2019-05-15 10:34:35,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:36,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2531|]. (let ((.cse0 (select |v_#memory_int_2531| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= |#memory_int| (store |v_#memory_int_2531| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:36,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:36,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2532|]. (let ((.cse0 (select |v_#memory_int_2532| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:34:36,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:36,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2533|]. (let ((.cse0 (select |v_#memory_int_2533| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:34:36,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:36,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2534|]. (let ((.cse0 (select |v_#memory_int_2534| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2534| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:36,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:36,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2535|]. (let ((.cse0 (select |v_#memory_int_2535| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_2535| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:36,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:36,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2536|]. (let ((.cse0 (select |v_#memory_int_2536| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2536| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:36,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2537|]. (let ((.cse0 (select |v_#memory_int_2537| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2537| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:34:36,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:36,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2538|]. (let ((.cse0 (select |v_#memory_int_2538| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:36,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,463 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2539|]. (let ((.cse0 (select |v_#memory_int_2539| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:34:36,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:36,511 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2540|]. (let ((.cse0 (select |v_#memory_int_2540| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2540| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:36,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:36,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2541|]. (let ((.cse0 (select |v_#memory_int_2541| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:34:36,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:36,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,635 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,642 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,643 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2542|]. (let ((.cse0 (select |v_#memory_int_2542| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,643 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:36,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2543|]. (let ((.cse0 (select |v_#memory_int_2543| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:36,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,764 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,764 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2544|]. (let ((.cse0 (select |v_#memory_int_2544| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= (store |v_#memory_int_2544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,764 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:36,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2545|]. (let ((.cse0 (select |v_#memory_int_2545| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_2545| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:36,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:36,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2546|]. (let ((.cse0 (select |v_#memory_int_2546| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2546| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 53 .cse0))) [2019-05-15 10:34:36,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:36,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:36,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:36,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:36,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:36,955 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:36,956 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2547|]. (let ((.cse0 (select |v_#memory_int_2547| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_2547| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:36,956 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:37,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2548|]. (let ((.cse0 (select |v_#memory_int_2548| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2548| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:34:37,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:37,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2549|]. (let ((.cse0 (select |v_#memory_int_2549| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2549| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:37,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,157 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2550|]. (let ((.cse0 (select |v_#memory_int_2550| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2550| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:37,157 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:37,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2551|]. (let ((.cse0 (select |v_#memory_int_2551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:34:37,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:37,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2552|]. (let ((.cse0 (select |v_#memory_int_2552| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:34:37,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:37,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,357 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2553|]. (let ((.cse0 (select |v_#memory_int_2553| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:37,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2554|]. (let ((.cse0 (select |v_#memory_int_2554| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_2554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:37,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2555|]. (let ((.cse0 (select |v_#memory_int_2555| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:37,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2556|]. (let ((.cse0 (select |v_#memory_int_2556| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:34:37,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:37,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2557|]. (let ((.cse0 (select |v_#memory_int_2557| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2557| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:34:37,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:37,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2558|]. (let ((.cse0 (select |v_#memory_int_2558| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,712 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:37,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2559|]. (let ((.cse0 (select |v_#memory_int_2559| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:37,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:37,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2560|]. (let ((.cse0 (select |v_#memory_int_2560| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2560| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:34:37,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:37,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:37,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:37,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2561|]. (let ((.cse0 (select |v_#memory_int_2561| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2561| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:34:37,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:34:37,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:37,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:37,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:37,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:38,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:38,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2562|]. (let ((.cse0 (select |v_#memory_int_2562| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:34:38,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:34:38,065 INFO L273 TraceCheckUtils]: 0: Hoare triple {21994#true} havoc main_p1; {21994#true} is VALID [2019-05-15 10:34:38,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {21994#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {21994#true} is VALID [2019-05-15 10:34:38,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {21994#true} #memory_int := #memory_int[main_p1 := 0]; {22005#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:38,067 INFO L273 TraceCheckUtils]: 3: Hoare triple {22005#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22009#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:38,068 INFO L273 TraceCheckUtils]: 4: Hoare triple {22009#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22013#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:38,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {22013#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22017#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:38,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {22017#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22021#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:38,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {22021#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22025#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:38,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {22025#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22029#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:38,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {22029#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22033#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:38,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {22033#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22037#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:38,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {22037#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22041#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:38,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {22041#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22045#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:38,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {22045#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22049#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:38,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {22049#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22053#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:38,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {22053#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22057#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:38,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {22057#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22061#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:38,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {22061#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22065#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:38,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {22065#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22069#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:38,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {22069#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22073#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:38,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {22073#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22077#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:38,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {22077#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22081#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:38,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {22081#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22085#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:38,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {22085#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22089#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:38,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {22089#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22093#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:38,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {22093#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22097#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:38,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {22097#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22101#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:38,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {22101#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22105#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:38,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {22105#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22109#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:38,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {22109#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22113#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:38,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {22113#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22117#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:38,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {22117#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22121#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:38,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {22121#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22125#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:38,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {22125#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22129#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:38,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {22129#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22133#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:38,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {22133#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22137#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:38,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {22137#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22141#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:38,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {22141#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22145#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:38,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {22145#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22149#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:38,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {22149#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22153#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:38,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {22153#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22157#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:38,096 INFO L273 TraceCheckUtils]: 41: Hoare triple {22157#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22161#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:38,096 INFO L273 TraceCheckUtils]: 42: Hoare triple {22161#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22165#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:38,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {22165#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22169#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:38,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {22169#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22173#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:38,099 INFO L273 TraceCheckUtils]: 45: Hoare triple {22173#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22177#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:38,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {22177#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22181#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:38,100 INFO L273 TraceCheckUtils]: 47: Hoare triple {22181#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22185#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:38,101 INFO L273 TraceCheckUtils]: 48: Hoare triple {22185#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22189#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:38,102 INFO L273 TraceCheckUtils]: 49: Hoare triple {22189#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22193#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:38,102 INFO L273 TraceCheckUtils]: 50: Hoare triple {22193#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22197#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:38,103 INFO L273 TraceCheckUtils]: 51: Hoare triple {22197#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22201#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:38,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {22201#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22205#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:38,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {22205#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22209#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:38,105 INFO L273 TraceCheckUtils]: 54: Hoare triple {22209#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22213#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:38,106 INFO L273 TraceCheckUtils]: 55: Hoare triple {22213#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22217#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:38,107 INFO L273 TraceCheckUtils]: 56: Hoare triple {22217#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22221#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:38,111 INFO L273 TraceCheckUtils]: 57: Hoare triple {22221#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22225#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:38,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {22225#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22229#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:38,113 INFO L273 TraceCheckUtils]: 59: Hoare triple {22229#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22233#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:38,113 INFO L273 TraceCheckUtils]: 60: Hoare triple {22233#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22237#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:38,114 INFO L273 TraceCheckUtils]: 61: Hoare triple {22237#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22241#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:38,114 INFO L273 TraceCheckUtils]: 62: Hoare triple {22241#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22245#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:38,114 INFO L273 TraceCheckUtils]: 63: Hoare triple {22245#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22249#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:38,115 INFO L273 TraceCheckUtils]: 64: Hoare triple {22249#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22253#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:38,116 INFO L273 TraceCheckUtils]: 65: Hoare triple {22253#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22257#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:38,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {22257#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22261#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:38,118 INFO L273 TraceCheckUtils]: 67: Hoare triple {22261#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22265#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:38,118 INFO L273 TraceCheckUtils]: 68: Hoare triple {22265#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22269#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:38,119 INFO L273 TraceCheckUtils]: 69: Hoare triple {22269#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22273#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:38,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {22273#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22277#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:38,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {22277#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22281#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:34:38,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {22281#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22285#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:34:38,122 INFO L273 TraceCheckUtils]: 73: Hoare triple {22285#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} assume !(#memory_int[main_p1] >= 0); {21995#false} is VALID [2019-05-15 10:34:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-15 10:34:38,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-05-15 10:34:38,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:38,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states. [2019-05-15 10:34:38,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:38,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-05-15 10:34:38,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-15 10:34:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-05-15 10:34:38,195 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 73 states. [2019-05-15 10:34:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:48,502 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:34:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-15 10:34:48,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 74 [2019-05-15 10:34:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:34:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:34:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-05-15 10:34:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-05-15 10:34:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-05-15 10:34:48,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 77 transitions. [2019-05-15 10:34:48,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:48,568 INFO L225 Difference]: With dead ends: 76 [2019-05-15 10:34:48,568 INFO L226 Difference]: Without dead ends: 76 [2019-05-15 10:34:48,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-05-15 10:34:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-05-15 10:34:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-05-15 10:34:48,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:34:48,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2019-05-15 10:34:48,570 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2019-05-15 10:34:48,570 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2019-05-15 10:34:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:48,571 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:34:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:34:48,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:48,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:48,572 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2019-05-15 10:34:48,572 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2019-05-15 10:34:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:34:48,573 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-05-15 10:34:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:34:48,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:34:48,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:34:48,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:34:48,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:34:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:34:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-05-15 10:34:48,575 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-05-15 10:34:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:34:48,575 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-05-15 10:34:48,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-05-15 10:34:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-05-15 10:34:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-05-15 10:34:48,575 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:34:48,575 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-05-15 10:34:48,575 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:34:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:34:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -549720190, now seen corresponding path program 71 times [2019-05-15 10:34:48,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:34:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:48,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-15 10:34:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:34:48,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:34:48,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:34:48,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:34:48,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2563|]. (= (store |v_#memory_int_2563| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:34:48,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:34:48,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2564|]. (let ((.cse0 (select |v_#memory_int_2564| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2564| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:34:48,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,708 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2565|]. (let ((.cse0 (select |v_#memory_int_2565| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:34:48,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:34:48,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2566|]. (let ((.cse0 (select |v_#memory_int_2566| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2566| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:34:48,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:34:48,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2567|]. (let ((.cse0 (select |v_#memory_int_2567| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2567| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:34:48,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:34:48,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2568|]. (let ((.cse0 (select |v_#memory_int_2568| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2568| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:34:48,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:34:48,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2569|]. (let ((.cse0 (select |v_#memory_int_2569| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_2569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:34:48,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,828 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,828 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2570|]. (let ((.cse0 (select |v_#memory_int_2570| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:34:48,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:34:48,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2571|]. (let ((.cse0 (select |v_#memory_int_2571| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= (store |v_#memory_int_2571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:34:48,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2572|]. (let ((.cse0 (select |v_#memory_int_2572| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2572| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:34:48,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:34:48,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2573|]. (let ((.cse0 (select |v_#memory_int_2573| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_2573| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:34:48,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2574|]. (let ((.cse0 (select |v_#memory_int_2574| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:34:48,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2575|]. (let ((.cse0 (select |v_#memory_int_2575| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_2575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:48,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:34:48,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:48,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:48,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:48,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:48,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:48,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2576|]. (let ((.cse0 (select |v_#memory_int_2576| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_2576| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:48,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:34:49,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2577|]. (let ((.cse0 (select |v_#memory_int_2577| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2577| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:34:49,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:34:49,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,038 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,046 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,046 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2578|]. (let ((.cse0 (select |v_#memory_int_2578| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,046 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:34:49,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2579|]. (let ((.cse0 (select |v_#memory_int_2579| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:34:49,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:34:49,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,110 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2580|]. (let ((.cse0 (select |v_#memory_int_2580| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= (store |v_#memory_int_2580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:34:49,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2581|]. (let ((.cse0 (select |v_#memory_int_2581| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:34:49,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:34:49,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2582|]. (let ((.cse0 (select |v_#memory_int_2582| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2582| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:34:49,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:34:49,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2583|]. (let ((.cse0 (select |v_#memory_int_2583| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2583| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:34:49,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:34:49,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2584|]. (let ((.cse0 (select |v_#memory_int_2584| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:34:49,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:34:49,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2585|]. (let ((.cse0 (select |v_#memory_int_2585| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2585| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:34:49,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:34:49,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,315 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2586|]. (let ((.cse0 (select |v_#memory_int_2586| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_2586| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,315 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:34:49,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2587|]. (let ((.cse0 (select |v_#memory_int_2587| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_2587| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:49,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:34:49,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2588|]. (let ((.cse0 (select |v_#memory_int_2588| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:34:49,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2589|]. (let ((.cse0 (select |v_#memory_int_2589| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2589| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:34:49,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:34:49,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2590|]. (let ((.cse0 (select |v_#memory_int_2590| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2590| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:34:49,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:34:49,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2591|]. (let ((.cse0 (select |v_#memory_int_2591| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2591| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:34:49,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:34:49,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2592|]. (let ((.cse0 (select |v_#memory_int_2592| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_2592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:34:49,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2593|]. (let ((.cse0 (select |v_#memory_int_2593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:34:49,591 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:34:49,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2594|]. (let ((.cse0 (select |v_#memory_int_2594| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2594| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:34:49,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:34:49,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2595|]. (let ((.cse0 (select |v_#memory_int_2595| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:34:49,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,726 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,726 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2596|]. (let ((.cse0 (select |v_#memory_int_2596| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:34:49,726 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:34:49,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2597|]. (let ((.cse0 (select |v_#memory_int_2597| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:34:49,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:34:49,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2598|]. (let ((.cse0 (select |v_#memory_int_2598| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:49,828 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:34:49,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2599|]. (let ((.cse0 (select |v_#memory_int_2599| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= |#memory_int| (store |v_#memory_int_2599| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:49,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:34:49,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,926 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,926 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2600|]. (let ((.cse0 (select |v_#memory_int_2600| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:34:49,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:34:49,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:49,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:49,968 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:49,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:49,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:49,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2601|]. (let ((.cse0 (select |v_#memory_int_2601| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2601| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:34:49,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:34:50,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,026 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2602|]. (let ((.cse0 (select |v_#memory_int_2602| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2602| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:34:50,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:34:50,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2603|]. (let ((.cse0 (select |v_#memory_int_2603| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2603| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:34:50,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:34:50,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2604|]. (let ((.cse0 (select |v_#memory_int_2604| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_2604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:34:50,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2605|]. (let ((.cse0 (select |v_#memory_int_2605| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_2605| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:50,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:34:50,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2606|]. (let ((.cse0 (select |v_#memory_int_2606| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2606| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:34:50,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:34:50,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2607|]. (let ((.cse0 (select |v_#memory_int_2607| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_2607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:34:50,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2608|]. (let ((.cse0 (select |v_#memory_int_2608| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2608| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:34:50,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2609|]. (let ((.cse0 (select |v_#memory_int_2609| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:34:50,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2610|]. (let ((.cse0 (select |v_#memory_int_2610| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2610| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:34:50,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:34:50,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2611|]. (let ((.cse0 (select |v_#memory_int_2611| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2611| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:34:50,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:34:50,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2612|]. (let ((.cse0 (select |v_#memory_int_2612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:34:50,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:34:50,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2613|]. (let ((.cse0 (select |v_#memory_int_2613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:34:50,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:34:50,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2614|]. (let ((.cse0 (select |v_#memory_int_2614| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_2614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:34:50,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2615|]. (let ((.cse0 (select |v_#memory_int_2615| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:34:50,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,808 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,815 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2616|]. (let ((.cse0 (select |v_#memory_int_2616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:34:50,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:34:50,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2617|]. (let ((.cse0 (select |v_#memory_int_2617| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:34:50,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:34:50,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:50,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:50,941 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2618|]. (let ((.cse0 (select |v_#memory_int_2618| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:50,941 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:34:50,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:50,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:50,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:50,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2619|]. (let ((.cse0 (select |v_#memory_int_2619| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2619| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:51,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:34:51,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2620|]. (let ((.cse0 (select |v_#memory_int_2620| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:51,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:34:51,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2621|]. (let ((.cse0 (select |v_#memory_int_2621| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2621| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:34:51,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:34:51,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2622|]. (let ((.cse0 (select |v_#memory_int_2622| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2622| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:51,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:34:51,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2623|]. (let ((.cse0 (select |v_#memory_int_2623| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_2623| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:51,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:34:51,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2624|]. (let ((.cse0 (select |v_#memory_int_2624| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2624| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:34:51,340 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:34:51,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,406 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2625|]. (let ((.cse0 (select |v_#memory_int_2625| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2625| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:34:51,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:34:51,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2626|]. (let ((.cse0 (select |v_#memory_int_2626| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2626| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:34:51,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:34:51,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2627|]. (let ((.cse0 (select |v_#memory_int_2627| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2627| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:34:51,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:34:51,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2628|]. (let ((.cse0 (select |v_#memory_int_2628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:34:51,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:34:51,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2629|]. (let ((.cse0 (select |v_#memory_int_2629| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:34:51,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:34:51,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,810 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,811 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2630|]. (let ((.cse0 (select |v_#memory_int_2630| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2630| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 66 .cse0))) [2019-05-15 10:34:51,811 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:34:51,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2631|]. (let ((.cse0 (select |v_#memory_int_2631| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2631| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:34:51,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:34:51,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:51,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:51,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:51,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:51,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:51,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2632|]. (let ((.cse0 (select |v_#memory_int_2632| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2632| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 68))) [2019-05-15 10:34:51,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:34:52,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:52,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:52,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:52,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:52,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:52,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:52,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2633|]. (let ((.cse0 (select |v_#memory_int_2633| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2633| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:34:52,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:34:52,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:34:52,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:34:52,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:34:52,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:34:52,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:34:52,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:34:52,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2634|]. (let ((.cse0 (select |v_#memory_int_2634| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_2634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:34:52,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:34:52,175 INFO L273 TraceCheckUtils]: 0: Hoare triple {22592#true} havoc main_p1; {22592#true} is VALID [2019-05-15 10:34:52,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {22592#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {22592#true} is VALID [2019-05-15 10:34:52,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {22592#true} #memory_int := #memory_int[main_p1 := 0]; {22603#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:34:52,176 INFO L273 TraceCheckUtils]: 3: Hoare triple {22603#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22607#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:34:52,177 INFO L273 TraceCheckUtils]: 4: Hoare triple {22607#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22611#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:34:52,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {22611#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22615#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:34:52,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {22615#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22619#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:34:52,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {22619#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22623#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:34:52,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {22623#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22627#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:34:52,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {22627#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22631#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:34:52,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {22631#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22635#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:34:52,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {22635#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22639#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:34:52,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {22639#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22643#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:34:52,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {22643#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22647#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:34:52,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {22647#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22651#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:34:52,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {22651#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22655#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:34:52,185 INFO L273 TraceCheckUtils]: 16: Hoare triple {22655#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22659#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:34:52,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {22659#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22663#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:34:52,186 INFO L273 TraceCheckUtils]: 18: Hoare triple {22663#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22667#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:34:52,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {22667#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22671#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:34:52,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {22671#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22675#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:34:52,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {22675#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22679#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:34:52,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {22679#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22683#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:34:52,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {22683#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22687#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:34:52,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {22687#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22691#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:34:52,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {22691#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22695#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:34:52,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {22695#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22699#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:34:52,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {22699#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22703#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:34:52,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {22703#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22707#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:34:52,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {22707#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22711#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:34:52,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {22711#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22715#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:34:52,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {22715#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22719#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:34:52,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {22719#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22723#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:34:52,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {22723#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22727#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:34:52,198 INFO L273 TraceCheckUtils]: 34: Hoare triple {22727#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22731#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:34:52,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {22731#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22735#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:34:52,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {22735#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22739#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:34:52,201 INFO L273 TraceCheckUtils]: 37: Hoare triple {22739#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22743#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:34:52,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {22743#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22747#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:34:52,202 INFO L273 TraceCheckUtils]: 39: Hoare triple {22747#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22751#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:34:52,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {22751#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22755#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:34:52,204 INFO L273 TraceCheckUtils]: 41: Hoare triple {22755#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22759#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:34:52,204 INFO L273 TraceCheckUtils]: 42: Hoare triple {22759#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22763#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:34:52,205 INFO L273 TraceCheckUtils]: 43: Hoare triple {22763#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22767#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:34:52,206 INFO L273 TraceCheckUtils]: 44: Hoare triple {22767#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22771#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:34:52,207 INFO L273 TraceCheckUtils]: 45: Hoare triple {22771#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22775#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:34:52,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {22775#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22779#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:34:52,208 INFO L273 TraceCheckUtils]: 47: Hoare triple {22779#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22783#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:34:52,209 INFO L273 TraceCheckUtils]: 48: Hoare triple {22783#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22787#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:34:52,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {22787#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22791#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:34:52,210 INFO L273 TraceCheckUtils]: 50: Hoare triple {22791#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22795#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:34:52,211 INFO L273 TraceCheckUtils]: 51: Hoare triple {22795#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22799#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:34:52,212 INFO L273 TraceCheckUtils]: 52: Hoare triple {22799#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22803#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:34:52,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {22803#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22807#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:34:52,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {22807#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22811#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:34:52,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {22811#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22815#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:34:52,215 INFO L273 TraceCheckUtils]: 56: Hoare triple {22815#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22819#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:34:52,216 INFO L273 TraceCheckUtils]: 57: Hoare triple {22819#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22823#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:34:52,216 INFO L273 TraceCheckUtils]: 58: Hoare triple {22823#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22827#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:34:52,217 INFO L273 TraceCheckUtils]: 59: Hoare triple {22827#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22831#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:34:52,218 INFO L273 TraceCheckUtils]: 60: Hoare triple {22831#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22835#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:34:52,219 INFO L273 TraceCheckUtils]: 61: Hoare triple {22835#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22839#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:34:52,219 INFO L273 TraceCheckUtils]: 62: Hoare triple {22839#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22843#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:34:52,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {22843#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22847#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:34:52,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {22847#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22851#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:34:52,222 INFO L273 TraceCheckUtils]: 65: Hoare triple {22851#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22855#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:34:52,222 INFO L273 TraceCheckUtils]: 66: Hoare triple {22855#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22859#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:34:52,223 INFO L273 TraceCheckUtils]: 67: Hoare triple {22859#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22863#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:34:52,224 INFO L273 TraceCheckUtils]: 68: Hoare triple {22863#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22867#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:34:52,225 INFO L273 TraceCheckUtils]: 69: Hoare triple {22867#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22871#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:34:52,225 INFO L273 TraceCheckUtils]: 70: Hoare triple {22871#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22875#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:34:52,226 INFO L273 TraceCheckUtils]: 71: Hoare triple {22875#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22879#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:34:52,227 INFO L273 TraceCheckUtils]: 72: Hoare triple {22879#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22883#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:34:52,228 INFO L273 TraceCheckUtils]: 73: Hoare triple {22883#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {22887#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:34:52,228 INFO L273 TraceCheckUtils]: 74: Hoare triple {22887#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} assume !(#memory_int[main_p1] >= 0); {22593#false} is VALID [2019-05-15 10:34:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:34:52,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:34:52,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-15 10:34:52,236 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-05-15 10:34:52,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:34:52,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states. [2019-05-15 10:34:52,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:34:52,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-05-15 10:34:52,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-15 10:34:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:34:52,296 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 74 states. [2019-05-15 10:35:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:03,128 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:03,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-15 10:35:03,129 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 75 [2019-05-15 10:35:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:35:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:35:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-05-15 10:35:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-05-15 10:35:03,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2019-05-15 10:35:03,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:03,202 INFO L225 Difference]: With dead ends: 77 [2019-05-15 10:35:03,202 INFO L226 Difference]: Without dead ends: 77 [2019-05-15 10:35:03,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-05-15 10:35:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-05-15 10:35:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-05-15 10:35:03,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:03,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:03,205 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:03,205 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:03,206 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:03,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:03,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:03,207 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:03,207 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 77 states. [2019-05-15 10:35:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:03,208 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-05-15 10:35:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:03,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:03,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:03,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:03,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:35:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-05-15 10:35:03,210 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-05-15 10:35:03,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:03,210 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-05-15 10:35:03,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-05-15 10:35:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-05-15 10:35:03,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-05-15 10:35:03,210 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:03,211 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-05-15 10:35:03,211 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 138543240, now seen corresponding path program 72 times [2019-05-15 10:35:03,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:03,244 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-15 10:35:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:03,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:03,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:35:03,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:03,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2635|]. (= |#memory_int| (store |v_#memory_int_2635| ULTIMATE.start_main_p1 0)) [2019-05-15 10:35:03,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:03,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2636|]. (let ((.cse0 (select |v_#memory_int_2636| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:35:03,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:03,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2637|]. (let ((.cse0 (select |v_#memory_int_2637| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:03,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:03,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2638|]. (let ((.cse0 (select |v_#memory_int_2638| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2638| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:03,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:03,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2639|]. (let ((.cse0 (select |v_#memory_int_2639| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_2639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:03,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:03,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2640|]. (let ((.cse0 (select |v_#memory_int_2640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:35:03,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:03,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2641|]. (let ((.cse0 (select |v_#memory_int_2641| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2641| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:35:03,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:03,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2642|]. (let ((.cse0 (select |v_#memory_int_2642| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= |#memory_int| (store |v_#memory_int_2642| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:03,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:03,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2643|]. (let ((.cse0 (select |v_#memory_int_2643| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_2643| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:03,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:03,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2644|]. (let ((.cse0 (select |v_#memory_int_2644| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2644| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:03,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:03,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2645|]. (let ((.cse0 (select |v_#memory_int_2645| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_2645| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:03,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:03,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2646|]. (let ((.cse0 (select |v_#memory_int_2646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:35:03,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:03,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2647|]. (let ((.cse0 (select |v_#memory_int_2647| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2647| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:35:03,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:03,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2648|]. (let ((.cse0 (select |v_#memory_int_2648| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:35:03,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:03,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,637 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,637 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2649|]. (let ((.cse0 (select |v_#memory_int_2649| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:35:03,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:03,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,670 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,670 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2650|]. (let ((.cse0 (select |v_#memory_int_2650| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_2650| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:03,671 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:03,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,703 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,703 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2651|]. (let ((.cse0 (select |v_#memory_int_2651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:35:03,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:03,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2652|]. (let ((.cse0 (select |v_#memory_int_2652| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2652| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:35:03,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:03,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2653|]. (let ((.cse0 (select |v_#memory_int_2653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:35:03,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:03,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2654|]. (let ((.cse0 (select |v_#memory_int_2654| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:35:03,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:03,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2655|]. (let ((.cse0 (select |v_#memory_int_2655| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:03,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:03,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2656|]. (let ((.cse0 (select |v_#memory_int_2656| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_2656| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:03,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:03,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2657|]. (let ((.cse0 (select |v_#memory_int_2657| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:03,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:03,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2658|]. (let ((.cse0 (select |v_#memory_int_2658| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2658| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:35:03,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:03,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:03,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:03,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:03,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:03,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:03,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2659|]. (let ((.cse0 (select |v_#memory_int_2659| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:03,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:04,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2660|]. (let ((.cse0 (select |v_#memory_int_2660| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= |#memory_int| (store |v_#memory_int_2660| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:04,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:04,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,063 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2661|]. (let ((.cse0 (select |v_#memory_int_2661| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_2661| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:04,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:04,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,111 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2662|]. (let ((.cse0 (select |v_#memory_int_2662| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2662| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:04,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2663|]. (let ((.cse0 (select |v_#memory_int_2663| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:04,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,188 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2664|]. (let ((.cse0 (select |v_#memory_int_2664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:35:04,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:04,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2665|]. (let ((.cse0 (select |v_#memory_int_2665| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:35:04,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:04,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2666|]. (let ((.cse0 (select |v_#memory_int_2666| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2666| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:35:04,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:04,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2667|]. (let ((.cse0 (select |v_#memory_int_2667| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= |#memory_int| (store |v_#memory_int_2667| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:04,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:04,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2668|]. (let ((.cse0 (select |v_#memory_int_2668| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2668| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:35:04,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:04,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2669|]. (let ((.cse0 (select |v_#memory_int_2669| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:35:04,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:04,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,468 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,468 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2670|]. (let ((.cse0 (select |v_#memory_int_2670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:35:04,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:04,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2671|]. (let ((.cse0 (select |v_#memory_int_2671| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_2671| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:04,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2672|]. (let ((.cse0 (select |v_#memory_int_2672| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_2672| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:04,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,627 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2673|]. (let ((.cse0 (select |v_#memory_int_2673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:35:04,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:04,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2674|]. (let ((.cse0 (select |v_#memory_int_2674| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2674| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:35:04,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:04,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2675|]. (let ((.cse0 (select |v_#memory_int_2675| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:04,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2676|]. (let ((.cse0 (select |v_#memory_int_2676| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:04,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2677|]. (let ((.cse0 (select |v_#memory_int_2677| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:35:04,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:04,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2678|]. (let ((.cse0 (select |v_#memory_int_2678| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_2678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:04,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:04,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2679|]. (let ((.cse0 (select |v_#memory_int_2679| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2679| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:35:04,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:04,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:04,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:04,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:04,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:04,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:04,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2680|]. (let ((.cse0 (select |v_#memory_int_2680| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= |#memory_int| (store |v_#memory_int_2680| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:04,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:05,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2681|]. (let ((.cse0 (select |v_#memory_int_2681| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:05,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:05,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2682|]. (let ((.cse0 (select |v_#memory_int_2682| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:35:05,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:05,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,160 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2683|]. (let ((.cse0 (select |v_#memory_int_2683| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_2683| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:05,160 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:05,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2684|]. (let ((.cse0 (select |v_#memory_int_2684| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:35:05,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:05,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,300 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2685|]. (let ((.cse0 (select |v_#memory_int_2685| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_2685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:05,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:05,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2686|]. (let ((.cse0 (select |v_#memory_int_2686| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:35:05,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:05,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2687|]. (let ((.cse0 (select |v_#memory_int_2687| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2687| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:05,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:05,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2688|]. (let ((.cse0 (select |v_#memory_int_2688| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2688| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:35:05,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:05,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2689|]. (let ((.cse0 (select |v_#memory_int_2689| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2689| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:35:05,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:05,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2690|]. (let ((.cse0 (select |v_#memory_int_2690| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2690| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:35:05,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:05,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2691|]. (let ((.cse0 (select |v_#memory_int_2691| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2691| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 55))) [2019-05-15 10:35:05,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:05,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2692|]. (let ((.cse0 (select |v_#memory_int_2692| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_2692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:05,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:05,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,781 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2693|]. (let ((.cse0 (select |v_#memory_int_2693| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_2693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:05,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:05,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:05,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:05,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:05,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:05,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:05,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2694|]. (let ((.cse0 (select |v_#memory_int_2694| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:35:05,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:06,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2695|]. (let ((.cse0 (select |v_#memory_int_2695| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_2695| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:06,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,188 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2696|]. (let ((.cse0 (select |v_#memory_int_2696| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,188 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:06,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2697|]. (let ((.cse0 (select |v_#memory_int_2697| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2697| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:35:06,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:06,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,324 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2698|]. (let ((.cse0 (select |v_#memory_int_2698| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= |#memory_int| (store |v_#memory_int_2698| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:06,324 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:06,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2699|]. (let ((.cse0 (select |v_#memory_int_2699| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:35:06,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:06,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,463 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2700|]. (let ((.cse0 (select |v_#memory_int_2700| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2700| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:35:06,463 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:06,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,532 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2701|]. (let ((.cse0 (select |v_#memory_int_2701| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,532 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:06,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2702|]. (let ((.cse0 (select |v_#memory_int_2702| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,605 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:06,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2703|]. (let ((.cse0 (select |v_#memory_int_2703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:06,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:06,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,753 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,753 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2704|]. (let ((.cse0 (select |v_#memory_int_2704| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2704| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:06,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2705|]. (let ((.cse0 (select |v_#memory_int_2705| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2705| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 69 .cse0))) [2019-05-15 10:35:06,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:06,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,899 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,900 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2706|]. (let ((.cse0 (select |v_#memory_int_2706| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= (store |v_#memory_int_2706| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,900 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:06,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:06,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:06,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:06,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:06,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:06,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2707|]. (let ((.cse0 (select |v_#memory_int_2707| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_2707| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:06,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:07,033 INFO L273 TraceCheckUtils]: 0: Hoare triple {23198#true} havoc main_p1; {23198#true} is VALID [2019-05-15 10:35:07,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {23198#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {23198#true} is VALID [2019-05-15 10:35:07,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {23198#true} #memory_int := #memory_int[main_p1 := 0]; {23209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:07,035 INFO L273 TraceCheckUtils]: 3: Hoare triple {23209#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:07,035 INFO L273 TraceCheckUtils]: 4: Hoare triple {23213#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:07,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {23217#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:07,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {23221#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:07,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {23225#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:07,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {23229#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:07,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {23233#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:07,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {23237#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:07,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {23241#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:07,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {23245#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:07,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {23249#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:07,043 INFO L273 TraceCheckUtils]: 14: Hoare triple {23253#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:07,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {23257#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:07,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {23261#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:07,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {23265#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:07,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {23269#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:07,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {23273#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:07,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {23277#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:07,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {23281#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:07,049 INFO L273 TraceCheckUtils]: 22: Hoare triple {23285#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:07,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {23289#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:07,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {23293#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:07,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {23297#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:07,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {23301#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:07,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {23305#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:07,053 INFO L273 TraceCheckUtils]: 28: Hoare triple {23309#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:07,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {23313#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:07,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {23317#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:07,056 INFO L273 TraceCheckUtils]: 31: Hoare triple {23321#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:07,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {23325#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:07,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {23329#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:07,058 INFO L273 TraceCheckUtils]: 34: Hoare triple {23333#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:07,059 INFO L273 TraceCheckUtils]: 35: Hoare triple {23337#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23341#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:07,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {23341#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23345#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:07,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {23345#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23349#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:07,061 INFO L273 TraceCheckUtils]: 38: Hoare triple {23349#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23353#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:07,062 INFO L273 TraceCheckUtils]: 39: Hoare triple {23353#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23357#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:07,063 INFO L273 TraceCheckUtils]: 40: Hoare triple {23357#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23361#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:07,063 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23365#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:07,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {23365#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23369#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:07,065 INFO L273 TraceCheckUtils]: 43: Hoare triple {23369#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23373#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:07,066 INFO L273 TraceCheckUtils]: 44: Hoare triple {23373#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23377#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:07,066 INFO L273 TraceCheckUtils]: 45: Hoare triple {23377#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23381#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:07,067 INFO L273 TraceCheckUtils]: 46: Hoare triple {23381#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23385#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:07,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {23385#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23389#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:07,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {23389#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23393#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:07,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {23393#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23397#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:07,070 INFO L273 TraceCheckUtils]: 50: Hoare triple {23397#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23401#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:07,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {23401#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23405#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:07,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {23405#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23409#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:07,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {23409#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23413#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:07,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {23413#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23417#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:07,074 INFO L273 TraceCheckUtils]: 55: Hoare triple {23417#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23421#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:07,075 INFO L273 TraceCheckUtils]: 56: Hoare triple {23421#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23425#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:07,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {23425#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23429#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:07,076 INFO L273 TraceCheckUtils]: 58: Hoare triple {23429#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23433#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:07,077 INFO L273 TraceCheckUtils]: 59: Hoare triple {23433#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23437#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:07,078 INFO L273 TraceCheckUtils]: 60: Hoare triple {23437#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23441#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:07,078 INFO L273 TraceCheckUtils]: 61: Hoare triple {23441#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23445#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:07,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {23445#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23449#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:07,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {23449#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23453#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:07,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {23453#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23457#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:07,082 INFO L273 TraceCheckUtils]: 65: Hoare triple {23457#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23461#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:07,082 INFO L273 TraceCheckUtils]: 66: Hoare triple {23461#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23465#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:07,083 INFO L273 TraceCheckUtils]: 67: Hoare triple {23465#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23469#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:07,084 INFO L273 TraceCheckUtils]: 68: Hoare triple {23469#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23473#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:07,085 INFO L273 TraceCheckUtils]: 69: Hoare triple {23473#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23477#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:07,085 INFO L273 TraceCheckUtils]: 70: Hoare triple {23477#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23481#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:07,086 INFO L273 TraceCheckUtils]: 71: Hoare triple {23481#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23485#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:07,087 INFO L273 TraceCheckUtils]: 72: Hoare triple {23485#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23489#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:07,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {23489#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23493#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:07,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {23493#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23497#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:07,089 INFO L273 TraceCheckUtils]: 75: Hoare triple {23497#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} assume !(#memory_int[main_p1] >= 0); {23199#false} is VALID [2019-05-15 10:35:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:07,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:07,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-15 10:35:07,097 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-05-15 10:35:07,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:07,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states. [2019-05-15 10:35:07,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:07,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-05-15 10:35:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-15 10:35:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-05-15 10:35:07,160 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 75 states. [2019-05-15 10:35:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:18,087 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:18,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-15 10:35:18,087 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 76 [2019-05-15 10:35:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:35:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-05-15 10:35:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-05-15 10:35:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-05-15 10:35:18,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2019-05-15 10:35:18,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:18,151 INFO L225 Difference]: With dead ends: 78 [2019-05-15 10:35:18,152 INFO L226 Difference]: Without dead ends: 78 [2019-05-15 10:35:18,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-05-15 10:35:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-05-15 10:35:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-05-15 10:35:18,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:18,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:18,153 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:18,153 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:18,154 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:18,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:18,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:18,154 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:18,155 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2019-05-15 10:35:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:18,155 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-05-15 10:35:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:18,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:18,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:18,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:18,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:35:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-05-15 10:35:18,156 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-05-15 10:35:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:18,157 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-05-15 10:35:18,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-05-15 10:35:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-05-15 10:35:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-05-15 10:35:18,157 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:18,157 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-05-15 10:35:18,157 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -126910, now seen corresponding path program 73 times [2019-05-15 10:35:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:18,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-15 10:35:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:18,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:18,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:35:18,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:18,306 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,306 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2708|]. (= (store |v_#memory_int_2708| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:18,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:18,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2709|]. (let ((.cse0 (select |v_#memory_int_2709| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_2709| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:18,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2710|]. (let ((.cse0 (select |v_#memory_int_2710| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_2710| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:18,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2711|]. (let ((.cse0 (select |v_#memory_int_2711| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2711| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:35:18,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:18,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,392 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2712|]. (let ((.cse0 (select |v_#memory_int_2712| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:35:18,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:18,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2713|]. (let ((.cse0 (select |v_#memory_int_2713| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_2713| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:18,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2714|]. (let ((.cse0 (select |v_#memory_int_2714| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_2714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:18,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2715|]. (let ((.cse0 (select |v_#memory_int_2715| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_2715| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:18,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2716|]. (let ((.cse0 (select |v_#memory_int_2716| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:35:18,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:18,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2717|]. (let ((.cse0 (select |v_#memory_int_2717| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2717| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:18,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,553 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2718|]. (let ((.cse0 (select |v_#memory_int_2718| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_2718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:18,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2719|]. (let ((.cse0 (select |v_#memory_int_2719| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:18,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2720|]. (let ((.cse0 (select |v_#memory_int_2720| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:18,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2721|]. (let ((.cse0 (select |v_#memory_int_2721| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:35:18,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:18,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2722|]. (let ((.cse0 (select |v_#memory_int_2722| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_2722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:18,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2723|]. (let ((.cse0 (select |v_#memory_int_2723| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_2723| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:18,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2724|]. (let ((.cse0 (select |v_#memory_int_2724| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_2724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:18,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2725|]. (let ((.cse0 (select |v_#memory_int_2725| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2725| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:35:18,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:18,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2726|]. (let ((.cse0 (select |v_#memory_int_2726| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2726| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:35:18,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:18,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2727|]. (let ((.cse0 (select |v_#memory_int_2727| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_2727| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:18,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:18,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2728|]. (let ((.cse0 (select |v_#memory_int_2728| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_2728| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:18,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:18,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2729|]. (let ((.cse0 (select |v_#memory_int_2729| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:35:18,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:18,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2730|]. (let ((.cse0 (select |v_#memory_int_2730| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2730| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:18,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:18,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:18,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:18,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:18,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:18,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:18,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2731|]. (let ((.cse0 (select |v_#memory_int_2731| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2731| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:35:18,988 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:19,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,025 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2732|]. (let ((.cse0 (select |v_#memory_int_2732| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2732| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:35:19,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:19,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2733|]. (let ((.cse0 (select |v_#memory_int_2733| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2733| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:19,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2734|]. (let ((.cse0 (select |v_#memory_int_2734| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:35:19,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:19,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2735|]. (let ((.cse0 (select |v_#memory_int_2735| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_2735| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:19,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2736|]. (let ((.cse0 (select |v_#memory_int_2736| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2736| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:35:19,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:19,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,222 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2737|]. (let ((.cse0 (select |v_#memory_int_2737| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_2737| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:19,222 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:19,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2738|]. (let ((.cse0 (select |v_#memory_int_2738| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2738| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:35:19,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:19,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2739|]. (let ((.cse0 (select |v_#memory_int_2739| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_2739| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:19,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2740|]. (let ((.cse0 (select |v_#memory_int_2740| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2740| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 31 .cse0))) [2019-05-15 10:35:19,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:19,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2741|]. (let ((.cse0 (select |v_#memory_int_2741| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_2741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:19,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2742|]. (let ((.cse0 (select |v_#memory_int_2742| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_2742| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:19,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,493 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2743|]. (let ((.cse0 (select |v_#memory_int_2743| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_2743| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:19,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:19,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2744|]. (let ((.cse0 (select |v_#memory_int_2744| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_2744| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:19,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:19,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,590 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,590 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2745|]. (let ((.cse0 (select |v_#memory_int_2745| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2745| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:35:19,590 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:19,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,646 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2746|]. (let ((.cse0 (select |v_#memory_int_2746| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:19,646 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:19,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2747|]. (let ((.cse0 (select |v_#memory_int_2747| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:35:19,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:19,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2748|]. (let ((.cse0 (select |v_#memory_int_2748| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2748| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:35:19,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:19,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2749|]. (let ((.cse0 (select |v_#memory_int_2749| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_2749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:19,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2750|]. (let ((.cse0 (select |v_#memory_int_2750| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2750| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:35:19,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:19,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,906 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,907 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2751|]. (let ((.cse0 (select |v_#memory_int_2751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:35:19,907 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:19,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:19,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:19,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:19,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:19,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:19,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2752|]. (let ((.cse0 (select |v_#memory_int_2752| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_2752| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:19,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:20,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2753|]. (let ((.cse0 (select |v_#memory_int_2753| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2753| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:35:20,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:20,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,071 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2754|]. (let ((.cse0 (select |v_#memory_int_2754| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_2754| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:20,071 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:20,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2755|]. (let ((.cse0 (select |v_#memory_int_2755| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2755| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:20,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,188 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,189 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2756|]. (let ((.cse0 (select |v_#memory_int_2756| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2756| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:35:20,189 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:20,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2757|]. (let ((.cse0 (select |v_#memory_int_2757| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:20,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2758|]. (let ((.cse0 (select |v_#memory_int_2758| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= |#memory_int| (store |v_#memory_int_2758| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:20,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:20,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2759|]. (let ((.cse0 (select |v_#memory_int_2759| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2759| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:35:20,394 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:20,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2760|]. (let ((.cse0 (select |v_#memory_int_2760| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_2760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:20,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,522 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,522 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2761|]. (let ((.cse0 (select |v_#memory_int_2761| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_2761| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,522 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:20,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2762|]. (let ((.cse0 (select |v_#memory_int_2762| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_2762| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:20,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2763|]. (let ((.cse0 (select |v_#memory_int_2763| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2763| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:35:20,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:20,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2764|]. (let ((.cse0 (select |v_#memory_int_2764| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2764| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:35:20,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:20,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2765|]. (let ((.cse0 (select |v_#memory_int_2765| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:35:20,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:20,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2766|]. (let ((.cse0 (select |v_#memory_int_2766| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_2766| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:20,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:20,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,924 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:20,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:20,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2767|]. (let ((.cse0 (select |v_#memory_int_2767| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_2767| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:20,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:20,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:20,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:20,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:20,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2768|]. (let ((.cse0 (select |v_#memory_int_2768| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= |#memory_int| (store |v_#memory_int_2768| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:21,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2769|]. (let ((.cse0 (select |v_#memory_int_2769| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2769| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 60))) [2019-05-15 10:35:21,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:21,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2770|]. (let ((.cse0 (select |v_#memory_int_2770| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_2770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:21,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:21,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,201 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,201 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2771|]. (let ((.cse0 (select |v_#memory_int_2771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:35:21,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:21,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,271 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2772|]. (let ((.cse0 (select |v_#memory_int_2772| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2772| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:35:21,271 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:21,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,331 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,344 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,344 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2773|]. (let ((.cse0 (select |v_#memory_int_2773| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= |#memory_int| (store |v_#memory_int_2773| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:21,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2774|]. (let ((.cse0 (select |v_#memory_int_2774| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_2774| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:21,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:21,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2775|]. (let ((.cse0 (select |v_#memory_int_2775| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:21,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:21,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,565 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2776|]. (let ((.cse0 (select |v_#memory_int_2776| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:21,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:21,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2777|]. (let ((.cse0 (select |v_#memory_int_2777| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2777| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:35:21,644 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:21,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2778|]. (let ((.cse0 (select |v_#memory_int_2778| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:35:21,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:21,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2779|]. (let ((.cse0 (select |v_#memory_int_2779| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_2779| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:21,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:21,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,865 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,865 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2780|]. (let ((.cse0 (select |v_#memory_int_2780| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:35:21,865 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:21,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:21,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:21,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:21,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:21,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:21,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2781|]. (let ((.cse0 (select |v_#memory_int_2781| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2781| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:35:21,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:35:22,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {23812#true} havoc main_p1; {23812#true} is VALID [2019-05-15 10:35:22,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {23812#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {23812#true} is VALID [2019-05-15 10:35:22,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {23812#true} #memory_int := #memory_int[main_p1 := 0]; {23823#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:22,004 INFO L273 TraceCheckUtils]: 3: Hoare triple {23823#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23827#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:22,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {23827#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23831#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:22,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {23831#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23835#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:22,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {23835#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23839#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:22,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {23839#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23843#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:22,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {23843#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23847#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:22,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {23847#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23851#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:22,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {23851#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23855#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:22,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {23855#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23859#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:22,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {23859#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23863#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:22,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {23863#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23867#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:22,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {23867#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23871#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:22,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {23871#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23875#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:22,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {23875#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23879#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:22,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {23879#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23883#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:22,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {23883#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23887#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:22,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {23887#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23891#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:22,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {23891#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23895#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:22,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {23895#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23899#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:22,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {23899#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23903#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:22,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {23903#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23907#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:22,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {23907#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23911#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:22,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {23911#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23915#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:22,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {23915#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23919#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:22,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {23919#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23923#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:22,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {23923#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23927#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:22,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {23927#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23931#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:22,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {23931#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23935#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:22,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {23935#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23939#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:22,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {23939#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23943#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:22,025 INFO L273 TraceCheckUtils]: 33: Hoare triple {23943#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23947#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:22,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {23947#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23951#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:22,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {23951#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23955#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:22,027 INFO L273 TraceCheckUtils]: 36: Hoare triple {23955#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23959#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:22,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {23959#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23963#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:22,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {23963#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23967#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:22,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {23967#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23971#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:22,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {23971#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23975#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:22,031 INFO L273 TraceCheckUtils]: 41: Hoare triple {23975#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23979#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:22,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {23979#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23983#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:22,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {23983#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23987#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:22,033 INFO L273 TraceCheckUtils]: 44: Hoare triple {23987#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23991#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:22,034 INFO L273 TraceCheckUtils]: 45: Hoare triple {23991#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23995#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:22,034 INFO L273 TraceCheckUtils]: 46: Hoare triple {23995#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {23999#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:22,035 INFO L273 TraceCheckUtils]: 47: Hoare triple {23999#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24003#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:22,036 INFO L273 TraceCheckUtils]: 48: Hoare triple {24003#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24007#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:22,037 INFO L273 TraceCheckUtils]: 49: Hoare triple {24007#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24011#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:22,037 INFO L273 TraceCheckUtils]: 50: Hoare triple {24011#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24015#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:22,038 INFO L273 TraceCheckUtils]: 51: Hoare triple {24015#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24019#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:22,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {24019#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24023#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:22,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {24023#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24027#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:22,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {24027#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24031#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:22,041 INFO L273 TraceCheckUtils]: 55: Hoare triple {24031#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24035#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:22,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {24035#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24039#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:22,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {24039#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24043#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:22,043 INFO L273 TraceCheckUtils]: 58: Hoare triple {24043#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24047#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:22,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {24047#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24051#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:22,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {24051#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24055#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:22,046 INFO L273 TraceCheckUtils]: 61: Hoare triple {24055#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24059#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:22,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {24059#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24063#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:22,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {24063#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24067#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:22,048 INFO L273 TraceCheckUtils]: 64: Hoare triple {24067#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24071#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:22,049 INFO L273 TraceCheckUtils]: 65: Hoare triple {24071#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24075#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:22,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {24075#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24079#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:22,050 INFO L273 TraceCheckUtils]: 67: Hoare triple {24079#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24083#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:22,051 INFO L273 TraceCheckUtils]: 68: Hoare triple {24083#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24087#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:22,052 INFO L273 TraceCheckUtils]: 69: Hoare triple {24087#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24091#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:22,052 INFO L273 TraceCheckUtils]: 70: Hoare triple {24091#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24095#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:22,053 INFO L273 TraceCheckUtils]: 71: Hoare triple {24095#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24099#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:22,054 INFO L273 TraceCheckUtils]: 72: Hoare triple {24099#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24103#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:22,055 INFO L273 TraceCheckUtils]: 73: Hoare triple {24103#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24107#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:22,055 INFO L273 TraceCheckUtils]: 74: Hoare triple {24107#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24111#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:22,056 INFO L273 TraceCheckUtils]: 75: Hoare triple {24111#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24115#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:35:22,057 INFO L273 TraceCheckUtils]: 76: Hoare triple {24115#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} assume !(#memory_int[main_p1] >= 0); {23813#false} is VALID [2019-05-15 10:35:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:22,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:22,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-15 10:35:22,065 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-05-15 10:35:22,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:22,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states. [2019-05-15 10:35:22,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:22,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-05-15 10:35:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-15 10:35:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:35:22,128 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 76 states. [2019-05-15 10:35:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:33,575 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-15 10:35:33,575 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 77 [2019-05-15 10:35:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:35:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:35:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-05-15 10:35:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2019-05-15 10:35:33,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2019-05-15 10:35:33,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:33,642 INFO L225 Difference]: With dead ends: 79 [2019-05-15 10:35:33,642 INFO L226 Difference]: Without dead ends: 79 [2019-05-15 10:35:33,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-05-15 10:35:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-05-15 10:35:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-05-15 10:35:33,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:33,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:33,644 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:33,644 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:33,645 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:33,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:33,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:33,646 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:33,646 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2019-05-15 10:35:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:33,647 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-05-15 10:35:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:33,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:33,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:33,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:33,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:35:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-05-15 10:35:33,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-05-15 10:35:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:33,649 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-05-15 10:35:33,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-05-15 10:35:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-05-15 10:35:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-05-15 10:35:33,649 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:33,649 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-05-15 10:35:33,649 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -3934264, now seen corresponding path program 74 times [2019-05-15 10:35:33,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:33,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-15 10:35:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:33,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:33,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:35:33,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:33,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2782|]. (= (store |v_#memory_int_2782| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:33,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:33,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2783|]. (let ((.cse0 (select |v_#memory_int_2783| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_2783| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:33,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:33,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,816 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,816 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2784|]. (let ((.cse0 (select |v_#memory_int_2784| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2784| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:35:33,816 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:33,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2785|]. (let ((.cse0 (select |v_#memory_int_2785| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:33,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:33,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2786|]. (let ((.cse0 (select |v_#memory_int_2786| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_2786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:33,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:33,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2787|]. (let ((.cse0 (select |v_#memory_int_2787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:35:33,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:33,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2788|]. (let ((.cse0 (select |v_#memory_int_2788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:35:33,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:33,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2789|]. (let ((.cse0 (select |v_#memory_int_2789| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2789| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:35:33,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:33,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2790|]. (let ((.cse0 (select |v_#memory_int_2790| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2790| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:35:33,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:33,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:33,977 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:33,977 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2791|]. (let ((.cse0 (select |v_#memory_int_2791| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2791| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:35:33,977 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:33,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:33,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:33,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:33,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2792|]. (let ((.cse0 (select |v_#memory_int_2792| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_2792| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:34,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:34,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2793|]. (let ((.cse0 (select |v_#memory_int_2793| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2793| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:35:34,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:34,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2794|]. (let ((.cse0 (select |v_#memory_int_2794| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2794| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:35:34,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:34,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,092 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,092 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2795|]. (let ((.cse0 (select |v_#memory_int_2795| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_2795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,092 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:34,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2796|]. (let ((.cse0 (select |v_#memory_int_2796| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2796| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:35:34,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:34,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2797|]. (let ((.cse0 (select |v_#memory_int_2797| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_2797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:34,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,182 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,183 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2798|]. (let ((.cse0 (select |v_#memory_int_2798| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_2798| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:34,183 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:34,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2799|]. (let ((.cse0 (select |v_#memory_int_2799| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:35:34,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:34,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2800|]. (let ((.cse0 (select |v_#memory_int_2800| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_2800| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:34,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2801|]. (let ((.cse0 (select |v_#memory_int_2801| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_2801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:34,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2802|]. (let ((.cse0 (select |v_#memory_int_2802| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:34,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,357 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2803|]. (let ((.cse0 (select |v_#memory_int_2803| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2803| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:35:34,357 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:34,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,393 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,393 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2804|]. (let ((.cse0 (select |v_#memory_int_2804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:35:34,393 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:34,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2805|]. (let ((.cse0 (select |v_#memory_int_2805| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_2805| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:34,458 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,470 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2806|]. (let ((.cse0 (select |v_#memory_int_2806| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_2806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,470 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:34,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2807|]. (let ((.cse0 (select |v_#memory_int_2807| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:35:34,506 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:34,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,544 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2808|]. (let ((.cse0 (select |v_#memory_int_2808| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_2808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:34,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,594 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2809|]. (let ((.cse0 (select |v_#memory_int_2809| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= |#memory_int| (store |v_#memory_int_2809| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:34,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:34,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,635 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2810|]. (let ((.cse0 (select |v_#memory_int_2810| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2810| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:35:34,635 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:34,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2811|]. (let ((.cse0 (select |v_#memory_int_2811| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2811| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:35:34,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:34,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,721 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2812|]. (let ((.cse0 (select |v_#memory_int_2812| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_2812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:34,721 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:34,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,762 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2813|]. (let ((.cse0 (select |v_#memory_int_2813| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2813| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:34,762 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:34,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2814|]. (let ((.cse0 (select |v_#memory_int_2814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:35:34,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:34,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,852 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2815|]. (let ((.cse0 (select |v_#memory_int_2815| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2815| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:35:34,852 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:34,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,896 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,896 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2816|]. (let ((.cse0 (select |v_#memory_int_2816| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_2816| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,896 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:34,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,945 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2817|]. (let ((.cse0 (select |v_#memory_int_2817| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:34,945 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:34,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:34,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:34,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:34,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:34,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:34,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2818|]. (let ((.cse0 (select |v_#memory_int_2818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:35:34,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:35,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,037 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,037 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2819|]. (let ((.cse0 (select |v_#memory_int_2819| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_2819| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,037 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:35,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2820|]. (let ((.cse0 (select |v_#memory_int_2820| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2820| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:35,084 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:35,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,133 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2821|]. (let ((.cse0 (select |v_#memory_int_2821| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,133 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:35,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2822|]. (let ((.cse0 (select |v_#memory_int_2822| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_2822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:35,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2823|]. (let ((.cse0 (select |v_#memory_int_2823| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= |#memory_int| (store |v_#memory_int_2823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:35,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:35,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,298 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,298 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2824|]. (let ((.cse0 (select |v_#memory_int_2824| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_2824| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:35,298 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:35,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2825|]. (let ((.cse0 (select |v_#memory_int_2825| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:35:35,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:35,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2826|]. (let ((.cse0 (select |v_#memory_int_2826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:35:35,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:35,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2827|]. (let ((.cse0 (select |v_#memory_int_2827| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2827| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:35:35,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:35,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2828|]. (let ((.cse0 (select |v_#memory_int_2828| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2828| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 45))) [2019-05-15 10:35:35,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:35,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2829|]. (let ((.cse0 (select |v_#memory_int_2829| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2829| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:35,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2830|]. (let ((.cse0 (select |v_#memory_int_2830| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_2830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:35,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2831|]. (let ((.cse0 (select |v_#memory_int_2831| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_2831| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:35,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:35,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,735 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2832|]. (let ((.cse0 (select |v_#memory_int_2832| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_2832| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:35,735 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:35,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2833|]. (let ((.cse0 (select |v_#memory_int_2833| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2833| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:35,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:35,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2834|]. (let ((.cse0 (select |v_#memory_int_2834| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= |#memory_int| (store |v_#memory_int_2834| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:35,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:35,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2835|]. (let ((.cse0 (select |v_#memory_int_2835| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2835| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:35:35,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:35,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:35,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:35,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:35,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:35,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:35,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2836|]. (let ((.cse0 (select |v_#memory_int_2836| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2836| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:35:35,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:36,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2837|]. (let ((.cse0 (select |v_#memory_int_2837| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_2837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:36,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,106 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,107 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2838|]. (let ((.cse0 (select |v_#memory_int_2838| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_2838| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,107 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:36,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,172 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2839|]. (let ((.cse0 (select |v_#memory_int_2839| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= |#memory_int| (store |v_#memory_int_2839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,172 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:36,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,236 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,236 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2840|]. (let ((.cse0 (select |v_#memory_int_2840| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2840| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:35:36,236 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:36,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2841|]. (let ((.cse0 (select |v_#memory_int_2841| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= |#memory_int| (store |v_#memory_int_2841| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:36,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,370 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2842|]. (let ((.cse0 (select |v_#memory_int_2842| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2842| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 59))) [2019-05-15 10:35:36,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:36,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,436 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2843|]. (let ((.cse0 (select |v_#memory_int_2843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:35:36,436 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:36,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2844|]. (let ((.cse0 (select |v_#memory_int_2844| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2844| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:35:36,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:36,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2845|]. (let ((.cse0 (select |v_#memory_int_2845| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2845| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:35:36,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:36,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2846|]. (let ((.cse0 (select |v_#memory_int_2846| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_2846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,637 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:36,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2847|]. (let ((.cse0 (select |v_#memory_int_2847| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:35:36,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:36,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,773 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2848|]. (let ((.cse0 (select |v_#memory_int_2848| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_2848| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:36,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:36,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,851 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,851 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2849|]. (let ((.cse0 (select |v_#memory_int_2849| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_2849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:36,851 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:36,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:36,928 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:36,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2850|]. (let ((.cse0 (select |v_#memory_int_2850| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:35:36,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:36,990 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:36,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:36,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:36,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,003 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2851|]. (let ((.cse0 (select |v_#memory_int_2851| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_2851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,003 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:37,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2852|]. (let ((.cse0 (select |v_#memory_int_2852| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_2852| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:37,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:37,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2853|]. (let ((.cse0 (select |v_#memory_int_2853| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2853| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 70))) [2019-05-15 10:35:37,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:37,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2854|]. (let ((.cse0 (select |v_#memory_int_2854| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2854| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:35:37,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:37,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2855|]. (let ((.cse0 (select |v_#memory_int_2855| ULTIMATE.start_main_p1))) (and (= .cse0 72) (= |#memory_int| (store |v_#memory_int_2855| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:37,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:35:37,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:37,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:37,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:37,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:37,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:37,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2856|]. (let ((.cse0 (select |v_#memory_int_2856| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2856| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:35:37,375 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:35:37,440 INFO L273 TraceCheckUtils]: 0: Hoare triple {24434#true} havoc main_p1; {24434#true} is VALID [2019-05-15 10:35:37,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {24434#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {24434#true} is VALID [2019-05-15 10:35:37,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {24434#true} #memory_int := #memory_int[main_p1 := 0]; {24445#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:37,441 INFO L273 TraceCheckUtils]: 3: Hoare triple {24445#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24449#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:37,442 INFO L273 TraceCheckUtils]: 4: Hoare triple {24449#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24453#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:37,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {24453#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24457#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:37,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {24457#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24461#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:37,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {24461#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24465#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:37,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {24465#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24469#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:37,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {24469#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24473#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:37,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {24473#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24477#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:37,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {24477#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24481#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:37,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {24481#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24485#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:37,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {24485#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24489#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:37,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {24489#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24493#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:37,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {24493#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24497#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:37,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {24497#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24501#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:37,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {24501#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24505#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:37,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {24505#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24509#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:37,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {24509#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24513#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:37,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {24513#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24517#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:37,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {24517#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24521#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:37,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {24521#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24525#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:37,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {24525#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24529#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:37,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {24529#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24533#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:37,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {24533#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24537#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:37,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {24537#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24541#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:37,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {24541#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24545#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:37,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {24545#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24549#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:37,461 INFO L273 TraceCheckUtils]: 29: Hoare triple {24549#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24553#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:37,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {24553#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24557#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:37,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {24557#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24561#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:37,463 INFO L273 TraceCheckUtils]: 32: Hoare triple {24561#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24565#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:37,464 INFO L273 TraceCheckUtils]: 33: Hoare triple {24565#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24569#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:37,464 INFO L273 TraceCheckUtils]: 34: Hoare triple {24569#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24573#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:37,465 INFO L273 TraceCheckUtils]: 35: Hoare triple {24573#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24577#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:37,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {24577#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24581#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:37,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {24581#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24585#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:37,467 INFO L273 TraceCheckUtils]: 38: Hoare triple {24585#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24589#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:37,468 INFO L273 TraceCheckUtils]: 39: Hoare triple {24589#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24593#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:37,469 INFO L273 TraceCheckUtils]: 40: Hoare triple {24593#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24597#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:37,470 INFO L273 TraceCheckUtils]: 41: Hoare triple {24597#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24601#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:37,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {24601#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24605#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:37,471 INFO L273 TraceCheckUtils]: 43: Hoare triple {24605#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24609#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:37,472 INFO L273 TraceCheckUtils]: 44: Hoare triple {24609#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24613#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:37,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {24613#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24617#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:37,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {24617#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24621#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:37,474 INFO L273 TraceCheckUtils]: 47: Hoare triple {24621#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24625#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:37,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {24625#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24629#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:37,476 INFO L273 TraceCheckUtils]: 49: Hoare triple {24629#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24633#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:37,476 INFO L273 TraceCheckUtils]: 50: Hoare triple {24633#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24637#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:37,477 INFO L273 TraceCheckUtils]: 51: Hoare triple {24637#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24641#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:37,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {24641#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24645#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:37,479 INFO L273 TraceCheckUtils]: 53: Hoare triple {24645#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24649#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:37,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {24649#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24653#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:37,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {24653#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24657#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:37,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {24657#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24661#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:37,482 INFO L273 TraceCheckUtils]: 57: Hoare triple {24661#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24665#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:37,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {24665#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24669#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:37,483 INFO L273 TraceCheckUtils]: 59: Hoare triple {24669#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24673#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:37,484 INFO L273 TraceCheckUtils]: 60: Hoare triple {24673#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24677#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:37,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {24677#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24681#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:37,485 INFO L273 TraceCheckUtils]: 62: Hoare triple {24681#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24685#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:37,486 INFO L273 TraceCheckUtils]: 63: Hoare triple {24685#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24689#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:37,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {24689#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24693#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:37,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {24693#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24697#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:37,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {24697#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24701#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:37,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {24701#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24705#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:37,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {24705#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24709#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:37,491 INFO L273 TraceCheckUtils]: 69: Hoare triple {24709#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24713#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:37,491 INFO L273 TraceCheckUtils]: 70: Hoare triple {24713#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24717#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:37,492 INFO L273 TraceCheckUtils]: 71: Hoare triple {24717#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24721#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:37,493 INFO L273 TraceCheckUtils]: 72: Hoare triple {24721#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24725#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:37,494 INFO L273 TraceCheckUtils]: 73: Hoare triple {24725#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24729#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:37,494 INFO L273 TraceCheckUtils]: 74: Hoare triple {24729#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24733#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:37,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {24733#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24737#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:35:37,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {24737#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {24741#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:35:37,496 INFO L273 TraceCheckUtils]: 77: Hoare triple {24741#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} assume !(#memory_int[main_p1] >= 0); {24435#false} is VALID [2019-05-15 10:35:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:37,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:37,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-15 10:35:37,505 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-05-15 10:35:37,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:37,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states. [2019-05-15 10:35:37,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:37,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-05-15 10:35:37,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-15 10:35:37,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-05-15 10:35:37,566 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 77 states. [2019-05-15 10:35:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:49,103 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:35:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-15 10:35:49,103 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 78 [2019-05-15 10:35:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:35:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:35:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-05-15 10:35:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-05-15 10:35:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-05-15 10:35:49,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 77 states and 81 transitions. [2019-05-15 10:35:49,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:49,170 INFO L225 Difference]: With dead ends: 80 [2019-05-15 10:35:49,170 INFO L226 Difference]: Without dead ends: 80 [2019-05-15 10:35:49,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-05-15 10:35:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-05-15 10:35:49,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-05-15 10:35:49,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:35:49,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2019-05-15 10:35:49,172 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2019-05-15 10:35:49,173 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2019-05-15 10:35:49,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:49,173 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:35:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:35:49,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:49,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:49,174 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2019-05-15 10:35:49,174 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2019-05-15 10:35:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:35:49,174 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-05-15 10:35:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:35:49,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:35:49,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:35:49,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:35:49,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:35:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:35:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-05-15 10:35:49,176 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-05-15 10:35:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:35:49,176 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-05-15 10:35:49,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-05-15 10:35:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-05-15 10:35:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-05-15 10:35:49,176 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:35:49,176 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-05-15 10:35:49,176 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:35:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:35:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash -121962238, now seen corresponding path program 75 times [2019-05-15 10:35:49,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:35:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:49,207 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-15 10:35:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:35:49,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:35:49,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:35:49,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:35:49,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2857|]. (= (store |v_#memory_int_2857| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:35:49,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:35:49,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2858|]. (let ((.cse0 (select |v_#memory_int_2858| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:35:49,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:35:49,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2859|]. (let ((.cse0 (select |v_#memory_int_2859| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_2859| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:35:49,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,356 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,356 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2860|]. (let ((.cse0 (select |v_#memory_int_2860| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:35:49,356 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:35:49,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,382 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2861|]. (let ((.cse0 (select |v_#memory_int_2861| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2861| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:35:49,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:35:49,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2862|]. (let ((.cse0 (select |v_#memory_int_2862| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2862| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:35:49,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:35:49,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2863|]. (let ((.cse0 (select |v_#memory_int_2863| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:35:49,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:35:49,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,454 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2864|]. (let ((.cse0 (select |v_#memory_int_2864| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2864| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:35:49,454 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:35:49,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2865|]. (let ((.cse0 (select |v_#memory_int_2865| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:35:49,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:35:49,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2866|]. (let ((.cse0 (select |v_#memory_int_2866| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_2866| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:49,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:35:49,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2867|]. (let ((.cse0 (select |v_#memory_int_2867| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_2867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:35:49,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,561 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2868|]. (let ((.cse0 (select |v_#memory_int_2868| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_2868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,561 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:35:49,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2869|]. (let ((.cse0 (select |v_#memory_int_2869| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:35:49,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2870|]. (let ((.cse0 (select |v_#memory_int_2870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:35:49,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:35:49,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2871|]. (let ((.cse0 (select |v_#memory_int_2871| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2871| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:35:49,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:35:49,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2872|]. (let ((.cse0 (select |v_#memory_int_2872| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2872| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 14 .cse0))) [2019-05-15 10:35:49,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:35:49,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2873|]. (let ((.cse0 (select |v_#memory_int_2873| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_2873| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:49,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:35:49,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2874|]. (let ((.cse0 (select |v_#memory_int_2874| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_2874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:35:49,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2875|]. (let ((.cse0 (select |v_#memory_int_2875| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_2875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:35:49,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2876|]. (let ((.cse0 (select |v_#memory_int_2876| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_2876| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:49,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:35:49,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2877|]. (let ((.cse0 (select |v_#memory_int_2877| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:35:49,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:35:49,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,879 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2878|]. (let ((.cse0 (select |v_#memory_int_2878| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_2878| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:49,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:35:49,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2879|]. (let ((.cse0 (select |v_#memory_int_2879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:35:49,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:35:49,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2880|]. (let ((.cse0 (select |v_#memory_int_2880| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2880| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:35:49,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:35:49,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:49,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:49,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:49,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:49,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:49,992 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2881|]. (let ((.cse0 (select |v_#memory_int_2881| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_2881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:49,992 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:35:50,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2882|]. (let ((.cse0 (select |v_#memory_int_2882| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:35:50,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:35:50,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,074 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2883|]. (let ((.cse0 (select |v_#memory_int_2883| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2883| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:35:50,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:35:50,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,113 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2884|]. (let ((.cse0 (select |v_#memory_int_2884| ULTIMATE.start_main_p1))) (and (= .cse0 26) (= (store |v_#memory_int_2884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:50,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:35:50,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2885|]. (let ((.cse0 (select |v_#memory_int_2885| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2885| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:35:50,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:35:50,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,199 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,199 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2886|]. (let ((.cse0 (select |v_#memory_int_2886| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2886| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:35:50,199 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:35:50,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:50,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:50,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:50,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:50,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:50,402 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2887|]. (let ((.cse0 (select |v_#memory_int_2887| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_2887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:50,402 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:35:51,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2888|]. (let ((.cse0 (select |v_#memory_int_2888| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2888| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:35:51,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:35:51,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,109 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,110 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2889|]. (let ((.cse0 (select |v_#memory_int_2889| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_2889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,110 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:35:51,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2890|]. (let ((.cse0 (select |v_#memory_int_2890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:35:51,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:35:51,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2891|]. (let ((.cse0 (select |v_#memory_int_2891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:35:51,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:35:51,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,254 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,254 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2892|]. (let ((.cse0 (select |v_#memory_int_2892| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,254 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:35:51,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,302 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2893|]. (let ((.cse0 (select |v_#memory_int_2893| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2893| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:35:51,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:35:51,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2894|]. (let ((.cse0 (select |v_#memory_int_2894| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2894| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:35:51,350 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:35:51,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2895|]. (let ((.cse0 (select |v_#memory_int_2895| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2895| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:35:51,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:35:51,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,451 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2896|]. (let ((.cse0 (select |v_#memory_int_2896| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_2896| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,451 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:35:51,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2897|]. (let ((.cse0 (select |v_#memory_int_2897| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:35:51,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:35:51,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2898|]. (let ((.cse0 (select |v_#memory_int_2898| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= |#memory_int| (store |v_#memory_int_2898| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:51,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:35:51,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2899|]. (let ((.cse0 (select |v_#memory_int_2899| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_2899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:35:51,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2900|]. (let ((.cse0 (select |v_#memory_int_2900| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2900| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:35:51,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:35:51,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2901|]. (let ((.cse0 (select |v_#memory_int_2901| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_2901| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:35:51,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2902|]. (let ((.cse0 (select |v_#memory_int_2902| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_2902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:35:51,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,827 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2903|]. (let ((.cse0 (select |v_#memory_int_2903| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2903| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:35:51,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2904|]. (let ((.cse0 (select |v_#memory_int_2904| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_2904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:51,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:35:51,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2905|]. (let ((.cse0 (select |v_#memory_int_2905| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2905| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 47))) [2019-05-15 10:35:51,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:35:51,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:51,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:51,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:51,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:51,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:51,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2906|]. (let ((.cse0 (select |v_#memory_int_2906| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2906| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:35:51,996 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:35:52,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,052 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,052 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2907|]. (let ((.cse0 (select |v_#memory_int_2907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:35:52,052 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:35:52,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,109 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2908|]. (let ((.cse0 (select |v_#memory_int_2908| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= |#memory_int| (store |v_#memory_int_2908| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:52,109 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:35:52,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2909|]. (let ((.cse0 (select |v_#memory_int_2909| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2909| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:35:52,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:35:52,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2910|]. (let ((.cse0 (select |v_#memory_int_2910| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_2910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:35:52,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2911|]. (let ((.cse0 (select |v_#memory_int_2911| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2911| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 53 .cse0))) [2019-05-15 10:35:52,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:35:52,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,359 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2912|]. (let ((.cse0 (select |v_#memory_int_2912| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2912| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 54 .cse0))) [2019-05-15 10:35:52,359 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:35:52,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2913|]. (let ((.cse0 (select |v_#memory_int_2913| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2913| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:35:52,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:35:52,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,486 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,487 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2914|]. (let ((.cse0 (select |v_#memory_int_2914| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_2914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,487 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:35:52,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,549 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,549 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2915|]. (let ((.cse0 (select |v_#memory_int_2915| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2915| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:35:52,549 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:35:52,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2916|]. (let ((.cse0 (select |v_#memory_int_2916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:35:52,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:35:52,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,676 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2917|]. (let ((.cse0 (select |v_#memory_int_2917| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:35:52,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:35:52,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,745 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,745 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2918|]. (let ((.cse0 (select |v_#memory_int_2918| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_2918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,745 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:35:52,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,809 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,809 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2919|]. (let ((.cse0 (select |v_#memory_int_2919| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2919| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:35:52,809 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:35:52,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,878 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2920|]. (let ((.cse0 (select |v_#memory_int_2920| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2920| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:35:52,878 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:35:52,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:52,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:52,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:52,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:52,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:52,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2921|]. (let ((.cse0 (select |v_#memory_int_2921| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_2921| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:52,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:35:53,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,023 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2922|]. (let ((.cse0 (select |v_#memory_int_2922| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2922| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:35:53,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:35:53,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,097 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,097 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2923|]. (let ((.cse0 (select |v_#memory_int_2923| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_2923| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,097 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:35:53,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2924|]. (let ((.cse0 (select |v_#memory_int_2924| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_2924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:35:53,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,252 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2925|]. (let ((.cse0 (select |v_#memory_int_2925| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_2925| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,252 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:35:53,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,322 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2926|]. (let ((.cse0 (select |v_#memory_int_2926| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= |#memory_int| (store |v_#memory_int_2926| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,322 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:35:53,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,394 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2927|]. (let ((.cse0 (select |v_#memory_int_2927| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2927| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:35:53,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:35:53,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,467 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2928|]. (let ((.cse0 (select |v_#memory_int_2928| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:35:53,467 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:35:53,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2929|]. (let ((.cse0 (select |v_#memory_int_2929| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_2929| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:35:53,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:35:53,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2930|]. (let ((.cse0 (select |v_#memory_int_2930| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= |#memory_int| (store |v_#memory_int_2930| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:35:53,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2931|]. (let ((.cse0 (select |v_#memory_int_2931| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= |#memory_int| (store |v_#memory_int_2931| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:35:53,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:35:53,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:35:53,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:35:53,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:35:53,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:35:53,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:35:53,771 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2932|]. (let ((.cse0 (select |v_#memory_int_2932| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 74 .cse0))) [2019-05-15 10:35:53,771 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:35:53,834 INFO L273 TraceCheckUtils]: 0: Hoare triple {25064#true} havoc main_p1; {25064#true} is VALID [2019-05-15 10:35:53,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {25064#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {25064#true} is VALID [2019-05-15 10:35:53,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {25064#true} #memory_int := #memory_int[main_p1 := 0]; {25075#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:35:53,836 INFO L273 TraceCheckUtils]: 3: Hoare triple {25075#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25079#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:35:53,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {25079#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25083#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:35:53,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {25083#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25087#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:35:53,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {25087#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25091#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:35:53,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {25091#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25095#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:35:53,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {25095#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25099#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:35:53,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {25099#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25103#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:35:53,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {25103#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25107#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:35:53,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {25107#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25111#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:35:53,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {25111#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25115#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:35:53,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {25115#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25119#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:35:53,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {25119#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25123#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:35:53,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {25123#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25127#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:35:53,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {25127#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25131#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:35:53,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {25131#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25135#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:35:53,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {25135#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25139#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:35:53,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {25139#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25143#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:35:53,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {25143#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25147#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:35:53,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {25147#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25151#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:35:53,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {25151#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25155#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:35:53,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {25155#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25159#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:35:53,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {25159#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25163#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:35:53,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {25163#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25167#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:35:53,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {25167#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25171#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:35:53,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {25171#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25175#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:35:53,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {25175#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25179#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:35:53,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {25179#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25183#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:35:53,856 INFO L273 TraceCheckUtils]: 30: Hoare triple {25183#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25187#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:35:53,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {25187#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25191#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:35:53,858 INFO L273 TraceCheckUtils]: 32: Hoare triple {25191#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25195#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:35:53,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {25195#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25199#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:35:53,859 INFO L273 TraceCheckUtils]: 34: Hoare triple {25199#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25203#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:35:53,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {25203#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25207#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:35:53,861 INFO L273 TraceCheckUtils]: 36: Hoare triple {25207#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25211#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:35:53,862 INFO L273 TraceCheckUtils]: 37: Hoare triple {25211#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25215#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:35:53,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {25215#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25219#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:35:53,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {25219#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25223#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:35:53,864 INFO L273 TraceCheckUtils]: 40: Hoare triple {25223#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25227#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:35:53,865 INFO L273 TraceCheckUtils]: 41: Hoare triple {25227#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25231#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:35:53,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {25231#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25235#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:35:53,866 INFO L273 TraceCheckUtils]: 43: Hoare triple {25235#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25239#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:35:53,867 INFO L273 TraceCheckUtils]: 44: Hoare triple {25239#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25243#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:35:53,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {25243#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25247#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:35:53,869 INFO L273 TraceCheckUtils]: 46: Hoare triple {25247#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25251#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:35:53,870 INFO L273 TraceCheckUtils]: 47: Hoare triple {25251#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25255#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:35:53,870 INFO L273 TraceCheckUtils]: 48: Hoare triple {25255#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25259#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:35:53,871 INFO L273 TraceCheckUtils]: 49: Hoare triple {25259#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25263#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:35:53,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {25263#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25267#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:35:53,873 INFO L273 TraceCheckUtils]: 51: Hoare triple {25267#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25271#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:35:53,873 INFO L273 TraceCheckUtils]: 52: Hoare triple {25271#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25275#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:35:53,874 INFO L273 TraceCheckUtils]: 53: Hoare triple {25275#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25279#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:35:53,875 INFO L273 TraceCheckUtils]: 54: Hoare triple {25279#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25283#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:35:53,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {25283#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25287#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:35:53,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {25287#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25291#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:35:53,877 INFO L273 TraceCheckUtils]: 57: Hoare triple {25291#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25295#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:35:53,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {25295#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25299#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:35:53,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {25299#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25303#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:35:53,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {25303#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25307#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:35:53,880 INFO L273 TraceCheckUtils]: 61: Hoare triple {25307#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25311#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:35:53,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {25311#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25315#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:35:53,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {25315#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25319#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:35:53,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {25319#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25323#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:35:53,884 INFO L273 TraceCheckUtils]: 65: Hoare triple {25323#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25327#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:35:53,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {25327#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25331#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:35:53,885 INFO L273 TraceCheckUtils]: 67: Hoare triple {25331#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25335#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:35:53,886 INFO L273 TraceCheckUtils]: 68: Hoare triple {25335#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25339#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:35:53,887 INFO L273 TraceCheckUtils]: 69: Hoare triple {25339#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25343#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:35:53,888 INFO L273 TraceCheckUtils]: 70: Hoare triple {25343#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25347#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:35:53,888 INFO L273 TraceCheckUtils]: 71: Hoare triple {25347#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25351#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:35:53,889 INFO L273 TraceCheckUtils]: 72: Hoare triple {25351#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25355#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:35:53,890 INFO L273 TraceCheckUtils]: 73: Hoare triple {25355#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25359#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:35:53,891 INFO L273 TraceCheckUtils]: 74: Hoare triple {25359#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25363#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:35:53,891 INFO L273 TraceCheckUtils]: 75: Hoare triple {25363#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25367#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:35:53,892 INFO L273 TraceCheckUtils]: 76: Hoare triple {25367#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25371#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:35:53,893 INFO L273 TraceCheckUtils]: 77: Hoare triple {25371#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25375#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:35:53,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {25375#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} assume !(#memory_int[main_p1] >= 0); {25065#false} is VALID [2019-05-15 10:35:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:35:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:35:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-15 10:35:53,903 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-05-15 10:35:53,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:35:53,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states. [2019-05-15 10:35:53,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:35:53,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-05-15 10:35:53,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-15 10:35:53,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:35:53,968 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 78 states. [2019-05-15 10:36:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:05,961 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-15 10:36:05,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 79 [2019-05-15 10:36:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:36:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:36:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-05-15 10:36:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-05-15 10:36:05,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2019-05-15 10:36:06,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:06,029 INFO L225 Difference]: With dead ends: 81 [2019-05-15 10:36:06,029 INFO L226 Difference]: Without dead ends: 81 [2019-05-15 10:36:06,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-05-15 10:36:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-05-15 10:36:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-05-15 10:36:06,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:06,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:06,031 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:06,031 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:06,031 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:06,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:06,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:06,032 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:06,032 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2019-05-15 10:36:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:06,033 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-05-15 10:36:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:06,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:06,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:06,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:06,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:36:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-05-15 10:36:06,034 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-05-15 10:36:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:06,034 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-05-15 10:36:06,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-05-15 10:36:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-05-15 10:36:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-05-15 10:36:06,035 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:06,035 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-05-15 10:36:06,035 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:06,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:06,035 INFO L82 PathProgramCache]: Analyzing trace with hash 514137864, now seen corresponding path program 76 times [2019-05-15 10:36:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:06,073 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-15 10:36:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:06,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:06,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:36:06,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:06,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2933|]. (= |#memory_int| (store |v_#memory_int_2933| ULTIMATE.start_main_p1 0)) [2019-05-15 10:36:06,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:06,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2934|]. (let ((.cse0 (select |v_#memory_int_2934| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2934| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:36:06,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:06,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,183 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2935|]. (let ((.cse0 (select |v_#memory_int_2935| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_2935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:06,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2936|]. (let ((.cse0 (select |v_#memory_int_2936| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2936| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:36:06,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:06,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2937|]. (let ((.cse0 (select |v_#memory_int_2937| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:36:06,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:06,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2938|]. (let ((.cse0 (select |v_#memory_int_2938| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2938| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:36:06,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:06,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2939|]. (let ((.cse0 (select |v_#memory_int_2939| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2939| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 5))) [2019-05-15 10:36:06,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:06,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2940|]. (let ((.cse0 (select |v_#memory_int_2940| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2940| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:36:06,299 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:06,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,331 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,331 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2941|]. (let ((.cse0 (select |v_#memory_int_2941| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_2941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,331 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:06,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,358 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,358 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2942|]. (let ((.cse0 (select |v_#memory_int_2942| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_2942| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:06,358 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:06,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2943|]. (let ((.cse0 (select |v_#memory_int_2943| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2943| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:36:06,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:06,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2944|]. (let ((.cse0 (select |v_#memory_int_2944| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= (store |v_#memory_int_2944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:06,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2945|]. (let ((.cse0 (select |v_#memory_int_2945| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_2945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:06,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,465 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2946|]. (let ((.cse0 (select |v_#memory_int_2946| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2946| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 12 .cse0))) [2019-05-15 10:36:06,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:06,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,497 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2947|]. (let ((.cse0 (select |v_#memory_int_2947| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2947| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:36:06,497 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:06,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2948|]. (let ((.cse0 (select |v_#memory_int_2948| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:36:06,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:06,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2949|]. (let ((.cse0 (select |v_#memory_int_2949| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2949| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 15))) [2019-05-15 10:36:06,556 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:06,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2950|]. (let ((.cse0 (select |v_#memory_int_2950| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2950| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:36:06,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:06,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,620 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,620 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2951|]. (let ((.cse0 (select |v_#memory_int_2951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:36:06,620 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:06,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2952|]. (let ((.cse0 (select |v_#memory_int_2952| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2952| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:36:06,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:06,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,687 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,687 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2953|]. (let ((.cse0 (select |v_#memory_int_2953| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_2953| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,688 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:06,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2954|]. (let ((.cse0 (select |v_#memory_int_2954| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:36:06,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:06,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2955|]. (let ((.cse0 (select |v_#memory_int_2955| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_2955| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:06,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:06,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,793 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2956|]. (let ((.cse0 (select |v_#memory_int_2956| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2956| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:36:06,793 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:06,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2957|]. (let ((.cse0 (select |v_#memory_int_2957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:36:06,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:06,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,870 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2958|]. (let ((.cse0 (select |v_#memory_int_2958| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_2958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:06,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2959|]. (let ((.cse0 (select |v_#memory_int_2959| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2959| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:36:06,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:06,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,949 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2960|]. (let ((.cse0 (select |v_#memory_int_2960| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_2960| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:06,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:06,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:06,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:06,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:06,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:06,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:06,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2961|]. (let ((.cse0 (select |v_#memory_int_2961| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_2961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:06,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:07,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2962|]. (let ((.cse0 (select |v_#memory_int_2962| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= |#memory_int| (store |v_#memory_int_2962| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:07,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2963|]. (let ((.cse0 (select |v_#memory_int_2963| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2963| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:36:07,077 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:07,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2964|]. (let ((.cse0 (select |v_#memory_int_2964| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_2964| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:07,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2965|]. (let ((.cse0 (select |v_#memory_int_2965| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2965| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:36:07,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:07,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,207 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2966|]. (let ((.cse0 (select |v_#memory_int_2966| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_2966| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,207 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:07,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2967|]. (let ((.cse0 (select |v_#memory_int_2967| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_2967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:07,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2968|]. (let ((.cse0 (select |v_#memory_int_2968| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_2968| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:07,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2969|]. (let ((.cse0 (select |v_#memory_int_2969| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2969| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 35))) [2019-05-15 10:36:07,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:07,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2970|]. (let ((.cse0 (select |v_#memory_int_2970| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2970| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:36:07,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:07,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2971|]. (let ((.cse0 (select |v_#memory_int_2971| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_2971| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:07,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,499 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2972|]. (let ((.cse0 (select |v_#memory_int_2972| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_2972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:07,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2973|]. (let ((.cse0 (select |v_#memory_int_2973| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_2973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:07,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2974|]. (let ((.cse0 (select |v_#memory_int_2974| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2974| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:36:07,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:07,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,667 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2975|]. (let ((.cse0 (select |v_#memory_int_2975| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2975| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:36:07,668 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:07,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2976|]. (let ((.cse0 (select |v_#memory_int_2976| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_2976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:07,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2977|]. (let ((.cse0 (select |v_#memory_int_2977| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2977| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:36:07,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:07,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,834 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2978|]. (let ((.cse0 (select |v_#memory_int_2978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:36:07,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:07,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,888 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2979|]. (let ((.cse0 (select |v_#memory_int_2979| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_2979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:07,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:07,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2980|]. (let ((.cse0 (select |v_#memory_int_2980| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_2980| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:07,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:07,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:07,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:07,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:07,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:07,997 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:07,998 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2981|]. (let ((.cse0 (select |v_#memory_int_2981| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:36:07,998 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:08,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2982|]. (let ((.cse0 (select |v_#memory_int_2982| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2982| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:08,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:08,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2983|]. (let ((.cse0 (select |v_#memory_int_2983| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:36:08,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:08,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,169 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2984|]. (let ((.cse0 (select |v_#memory_int_2984| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:36:08,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:08,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2985|]. (let ((.cse0 (select |v_#memory_int_2985| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2985| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 51))) [2019-05-15 10:36:08,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:08,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2986|]. (let ((.cse0 (select |v_#memory_int_2986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:36:08,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:08,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2987|]. (let ((.cse0 (select |v_#memory_int_2987| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_2987| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:08,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:08,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2988|]. (let ((.cse0 (select |v_#memory_int_2988| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:36:08,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:08,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2989|]. (let ((.cse0 (select |v_#memory_int_2989| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_2989| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:08,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,524 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2990|]. (let ((.cse0 (select |v_#memory_int_2990| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2990| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:36:08,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:08,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,589 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,589 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2991|]. (let ((.cse0 (select |v_#memory_int_2991| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_2991| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:36:08,589 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:08,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,651 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2992|]. (let ((.cse0 (select |v_#memory_int_2992| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_2992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,651 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:08,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,714 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,715 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2993|]. (let ((.cse0 (select |v_#memory_int_2993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:36:08,715 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:08,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2994|]. (let ((.cse0 (select |v_#memory_int_2994| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_2994| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:08,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,850 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2995|]. (let ((.cse0 (select |v_#memory_int_2995| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_2995| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:08,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:08,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,917 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,917 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2996|]. (let ((.cse0 (select |v_#memory_int_2996| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_2996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:08,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:08,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:08,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:08,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:08,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:08,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2997|]. (let ((.cse0 (select |v_#memory_int_2997| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_2997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:08,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:09,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2998|]. (let ((.cse0 (select |v_#memory_int_2998| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2998| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:36:09,065 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:09,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_2999|]. (let ((.cse0 (select |v_#memory_int_2999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_2999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:36:09,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:09,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3000|]. (let ((.cse0 (select |v_#memory_int_3000| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:09,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3001|]. (let ((.cse0 (select |v_#memory_int_3001| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= |#memory_int| (store |v_#memory_int_3001| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:09,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:09,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3002|]. (let ((.cse0 (select |v_#memory_int_3002| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= (store |v_#memory_int_3002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:09,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3003|]. (let ((.cse0 (select |v_#memory_int_3003| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3003| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:36:09,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:09,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3004|]. (let ((.cse0 (select |v_#memory_int_3004| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:09,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:09,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3005|]. (let ((.cse0 (select |v_#memory_int_3005| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:36:09,573 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:09,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,647 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3006|]. (let ((.cse0 (select |v_#memory_int_3006| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:36:09,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:09,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3007|]. (let ((.cse0 (select |v_#memory_int_3007| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= |#memory_int| (store |v_#memory_int_3007| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:09,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:09,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3008|]. (let ((.cse0 (select |v_#memory_int_3008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 74 .cse0))) [2019-05-15 10:36:09,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:09,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:09,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:09,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:09,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:09,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:09,877 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3009|]. (let ((.cse0 (select |v_#memory_int_3009| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 75 .cse0))) [2019-05-15 10:36:09,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:36:09,938 INFO L273 TraceCheckUtils]: 0: Hoare triple {25702#true} havoc main_p1; {25702#true} is VALID [2019-05-15 10:36:09,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {25702#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {25702#true} is VALID [2019-05-15 10:36:09,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {25702#true} #memory_int := #memory_int[main_p1 := 0]; {25713#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:09,939 INFO L273 TraceCheckUtils]: 3: Hoare triple {25713#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25717#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:09,939 INFO L273 TraceCheckUtils]: 4: Hoare triple {25717#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25721#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:09,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {25721#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25725#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:09,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {25725#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25729#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:09,941 INFO L273 TraceCheckUtils]: 7: Hoare triple {25729#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25733#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:09,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {25733#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25737#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:09,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {25737#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25741#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:09,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {25741#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25745#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:09,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {25745#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25749#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:09,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {25749#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25753#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:09,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {25753#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25757#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:09,945 INFO L273 TraceCheckUtils]: 14: Hoare triple {25757#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25761#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:09,946 INFO L273 TraceCheckUtils]: 15: Hoare triple {25761#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25765#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:09,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {25765#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25769#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:09,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {25769#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25773#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:09,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {25773#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25777#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:09,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {25777#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25781#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:09,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {25781#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25785#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:09,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {25785#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25789#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:09,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {25789#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25793#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:09,952 INFO L273 TraceCheckUtils]: 23: Hoare triple {25793#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25797#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:09,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {25797#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25801#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:09,953 INFO L273 TraceCheckUtils]: 25: Hoare triple {25801#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25805#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:09,954 INFO L273 TraceCheckUtils]: 26: Hoare triple {25805#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25809#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:09,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {25809#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25813#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:09,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {25813#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25817#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:09,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {25817#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25821#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:09,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {25821#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25825#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:09,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {25825#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25829#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:09,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {25829#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25833#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:09,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {25833#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25837#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:09,960 INFO L273 TraceCheckUtils]: 34: Hoare triple {25837#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25841#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:09,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {25841#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25845#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:09,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {25845#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25849#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:09,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {25849#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25853#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:09,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {25853#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25857#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:09,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {25857#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25861#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:09,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {25861#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25865#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:09,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {25865#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25869#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:09,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {25869#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25873#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:09,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {25873#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25877#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:09,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {25877#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25881#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:09,968 INFO L273 TraceCheckUtils]: 45: Hoare triple {25881#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25885#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:09,971 INFO L273 TraceCheckUtils]: 46: Hoare triple {25885#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25889#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:09,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {25889#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25893#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:09,972 INFO L273 TraceCheckUtils]: 48: Hoare triple {25893#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25897#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:09,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {25897#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25901#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:09,973 INFO L273 TraceCheckUtils]: 50: Hoare triple {25901#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25905#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:09,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {25905#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25909#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:09,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {25909#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25913#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:09,975 INFO L273 TraceCheckUtils]: 53: Hoare triple {25913#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25917#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:09,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {25917#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25921#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:09,976 INFO L273 TraceCheckUtils]: 55: Hoare triple {25921#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25925#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:09,977 INFO L273 TraceCheckUtils]: 56: Hoare triple {25925#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25929#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:09,977 INFO L273 TraceCheckUtils]: 57: Hoare triple {25929#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25933#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:09,978 INFO L273 TraceCheckUtils]: 58: Hoare triple {25933#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25937#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:09,979 INFO L273 TraceCheckUtils]: 59: Hoare triple {25937#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25941#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:09,980 INFO L273 TraceCheckUtils]: 60: Hoare triple {25941#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25945#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:09,980 INFO L273 TraceCheckUtils]: 61: Hoare triple {25945#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25949#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:09,981 INFO L273 TraceCheckUtils]: 62: Hoare triple {25949#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25953#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:09,982 INFO L273 TraceCheckUtils]: 63: Hoare triple {25953#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25957#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:09,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {25957#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25961#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:09,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {25961#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25965#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:09,984 INFO L273 TraceCheckUtils]: 66: Hoare triple {25965#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25969#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:09,985 INFO L273 TraceCheckUtils]: 67: Hoare triple {25969#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25973#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:09,986 INFO L273 TraceCheckUtils]: 68: Hoare triple {25973#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25977#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:09,986 INFO L273 TraceCheckUtils]: 69: Hoare triple {25977#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25981#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:09,987 INFO L273 TraceCheckUtils]: 70: Hoare triple {25981#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25985#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:09,988 INFO L273 TraceCheckUtils]: 71: Hoare triple {25985#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25989#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:09,989 INFO L273 TraceCheckUtils]: 72: Hoare triple {25989#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25993#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:09,989 INFO L273 TraceCheckUtils]: 73: Hoare triple {25993#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {25997#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:09,990 INFO L273 TraceCheckUtils]: 74: Hoare triple {25997#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26001#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:09,991 INFO L273 TraceCheckUtils]: 75: Hoare triple {26001#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26005#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:09,992 INFO L273 TraceCheckUtils]: 76: Hoare triple {26005#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26009#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:09,992 INFO L273 TraceCheckUtils]: 77: Hoare triple {26009#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26013#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:09,993 INFO L273 TraceCheckUtils]: 78: Hoare triple {26013#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26017#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:36:09,994 INFO L273 TraceCheckUtils]: 79: Hoare triple {26017#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} assume !(#memory_int[main_p1] >= 0); {25703#false} is VALID [2019-05-15 10:36:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:10,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:10,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-15 10:36:10,003 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-05-15 10:36:10,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:10,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states. [2019-05-15 10:36:10,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:10,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-05-15 10:36:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-15 10:36:10,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-05-15 10:36:10,088 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 79 states. [2019-05-15 10:36:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:22,369 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-15 10:36:22,369 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 80 [2019-05-15 10:36:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:36:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-05-15 10:36:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-05-15 10:36:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-05-15 10:36:22,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 83 transitions. [2019-05-15 10:36:22,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:22,442 INFO L225 Difference]: With dead ends: 82 [2019-05-15 10:36:22,442 INFO L226 Difference]: Without dead ends: 82 [2019-05-15 10:36:22,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-05-15 10:36:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-05-15 10:36:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-05-15 10:36:22,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:22,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:22,444 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:22,445 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:22,446 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:22,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:22,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:22,446 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:22,446 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2019-05-15 10:36:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:22,447 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-05-15 10:36:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:22,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:22,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:22,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:22,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:22,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:36:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-05-15 10:36:22,449 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-05-15 10:36:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:22,449 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-05-15 10:36:22,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-05-15 10:36:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-05-15 10:36:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-05-15 10:36:22,450 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:22,450 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-05-15 10:36:22,450 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1241595454, now seen corresponding path program 77 times [2019-05-15 10:36:22,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:22,482 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-15 10:36:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:22,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:22,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:36:22,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:22,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3010|]. (= (store |v_#memory_int_3010| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:22,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:22,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3011|]. (let ((.cse0 (select |v_#memory_int_3011| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3011| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:36:22,544 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:22,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,555 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3012|]. (let ((.cse0 (select |v_#memory_int_3012| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3012| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:22,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:22,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,581 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3013|]. (let ((.cse0 (select |v_#memory_int_3013| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3013| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:36:22,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:22,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,606 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3014|]. (let ((.cse0 (select |v_#memory_int_3014| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:22,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:22,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3015|]. (let ((.cse0 (select |v_#memory_int_3015| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3015| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 4 .cse0))) [2019-05-15 10:36:22,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:22,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,651 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,652 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3016|]. (let ((.cse0 (select |v_#memory_int_3016| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3016| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:36:22,652 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:22,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3017|]. (let ((.cse0 (select |v_#memory_int_3017| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:36:22,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:22,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3018|]. (let ((.cse0 (select |v_#memory_int_3018| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3018| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:36:22,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:22,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3019|]. (let ((.cse0 (select |v_#memory_int_3019| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3019| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:36:22,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:22,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,756 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3020|]. (let ((.cse0 (select |v_#memory_int_3020| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3020| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 9 .cse0))) [2019-05-15 10:36:22,756 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:22,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3021|]. (let ((.cse0 (select |v_#memory_int_3021| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_3021| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:22,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:22,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3022|]. (let ((.cse0 (select |v_#memory_int_3022| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= |#memory_int| (store |v_#memory_int_3022| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:22,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:22,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,842 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3023|]. (let ((.cse0 (select |v_#memory_int_3023| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_3023| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:22,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:22,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3024|]. (let ((.cse0 (select |v_#memory_int_3024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 13 .cse0))) [2019-05-15 10:36:22,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:22,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3025|]. (let ((.cse0 (select |v_#memory_int_3025| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_3025| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:22,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:22,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3026|]. (let ((.cse0 (select |v_#memory_int_3026| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3026| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:22,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:22,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:22,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:22,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3027|]. (let ((.cse0 (select |v_#memory_int_3027| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3027| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:22,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:22,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:22,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:22,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:22,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,005 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,006 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3028|]. (let ((.cse0 (select |v_#memory_int_3028| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3028| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 17 .cse0))) [2019-05-15 10:36:23,006 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:23,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3029|]. (let ((.cse0 (select |v_#memory_int_3029| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_3029| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:23,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3030|]. (let ((.cse0 (select |v_#memory_int_3030| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:23,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,113 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3031|]. (let ((.cse0 (select |v_#memory_int_3031| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,113 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:23,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3032|]. (let ((.cse0 (select |v_#memory_int_3032| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_3032| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:23,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3033|]. (let ((.cse0 (select |v_#memory_int_3033| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:36:23,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:23,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3034|]. (let ((.cse0 (select |v_#memory_int_3034| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3034| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:36:23,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:23,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,262 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3035|]. (let ((.cse0 (select |v_#memory_int_3035| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,263 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:23,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3036|]. (let ((.cse0 (select |v_#memory_int_3036| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,304 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:23,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,342 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3037|]. (let ((.cse0 (select |v_#memory_int_3037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:36:23,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:23,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3038|]. (let ((.cse0 (select |v_#memory_int_3038| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= (store |v_#memory_int_3038| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:23,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3039|]. (let ((.cse0 (select |v_#memory_int_3039| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3039| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:23,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:23,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,469 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,469 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3040|]. (let ((.cse0 (select |v_#memory_int_3040| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,469 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:23,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3041|]. (let ((.cse0 (select |v_#memory_int_3041| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_3041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:23,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3042|]. (let ((.cse0 (select |v_#memory_int_3042| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3042| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:23,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3043|]. (let ((.cse0 (select |v_#memory_int_3043| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3043| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:36:23,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:23,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3044|]. (let ((.cse0 (select |v_#memory_int_3044| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3044| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:36:23,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:23,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3045|]. (let ((.cse0 (select |v_#memory_int_3045| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_3045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:23,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3046|]. (let ((.cse0 (select |v_#memory_int_3046| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:36:23,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:23,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,796 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,796 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3047|]. (let ((.cse0 (select |v_#memory_int_3047| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= (store |v_#memory_int_3047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:23,796 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:23,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3048|]. (let ((.cse0 (select |v_#memory_int_3048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:36:23,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:23,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,895 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3049|]. (let ((.cse0 (select |v_#memory_int_3049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:36:23,895 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:23,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:23,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:23,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3050|]. (let ((.cse0 (select |v_#memory_int_3050| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3050| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 39))) [2019-05-15 10:36:23,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:23,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:23,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:23,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:23,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,004 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3051|]. (let ((.cse0 (select |v_#memory_int_3051| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:24,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,053 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3052|]. (let ((.cse0 (select |v_#memory_int_3052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:36:24,053 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:24,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,106 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3053|]. (let ((.cse0 (select |v_#memory_int_3053| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:36:24,106 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:24,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,160 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3054|]. (let ((.cse0 (select |v_#memory_int_3054| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3054| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:24,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3055|]. (let ((.cse0 (select |v_#memory_int_3055| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3055| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 44))) [2019-05-15 10:36:24,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:24,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,270 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3056|]. (let ((.cse0 (select |v_#memory_int_3056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:36:24,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:24,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,327 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,327 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3057|]. (let ((.cse0 (select |v_#memory_int_3057| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:36:24,327 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:24,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,387 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,387 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3058|]. (let ((.cse0 (select |v_#memory_int_3058| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_3058| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:24,387 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:24,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3059|]. (let ((.cse0 (select |v_#memory_int_3059| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3059| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:36:24,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:24,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3060|]. (let ((.cse0 (select |v_#memory_int_3060| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3060| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:24,549 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3061|]. (let ((.cse0 (select |v_#memory_int_3061| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3061| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:36:24,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:24,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3062|]. (let ((.cse0 (select |v_#memory_int_3062| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3062| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:36:24,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:24,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,678 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,678 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3063|]. (let ((.cse0 (select |v_#memory_int_3063| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:36:24,678 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:24,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,744 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,744 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3064|]. (let ((.cse0 (select |v_#memory_int_3064| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:36:24,744 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:24,796 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,797 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3065|]. (let ((.cse0 (select |v_#memory_int_3065| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_3065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:24,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3066|]. (let ((.cse0 (select |v_#memory_int_3066| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_3066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:24,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:24,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:24,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3067|]. (let ((.cse0 (select |v_#memory_int_3067| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:24,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:24,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:24,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:24,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:24,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,006 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,007 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3068|]. (let ((.cse0 (select |v_#memory_int_3068| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_3068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,007 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:25,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3069|]. (let ((.cse0 (select |v_#memory_int_3069| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3069| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:36:25,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:25,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,142 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,142 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3070|]. (let ((.cse0 (select |v_#memory_int_3070| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:36:25,142 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:25,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3071|]. (let ((.cse0 (select |v_#memory_int_3071| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:36:25,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:25,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3072|]. (let ((.cse0 (select |v_#memory_int_3072| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3072| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:36:25,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:25,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3073|]. (let ((.cse0 (select |v_#memory_int_3073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:36:25,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:25,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,422 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3074|]. (let ((.cse0 (select |v_#memory_int_3074| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_3074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,422 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:25,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3075|]. (let ((.cse0 (select |v_#memory_int_3075| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:36:25,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:25,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,564 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3076|]. (let ((.cse0 (select |v_#memory_int_3076| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,564 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:25,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3077|]. (let ((.cse0 (select |v_#memory_int_3077| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_3077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:25,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,712 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,712 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3078|]. (let ((.cse0 (select |v_#memory_int_3078| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_3078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:25,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:25,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3079|]. (let ((.cse0 (select |v_#memory_int_3079| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 68 .cse0))) [2019-05-15 10:36:25,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:25,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3080|]. (let ((.cse0 (select |v_#memory_int_3080| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:36:25,862 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:25,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:25,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:25,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:25,936 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:25,936 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3081|]. (let ((.cse0 (select |v_#memory_int_3081| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= |#memory_int| (store |v_#memory_int_3081| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:25,936 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:25,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:25,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,009 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,009 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3082|]. (let ((.cse0 (select |v_#memory_int_3082| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:36:26,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:26,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,084 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,084 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3083|]. (let ((.cse0 (select |v_#memory_int_3083| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3083| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:36:26,085 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:26,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,159 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,159 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3084|]. (let ((.cse0 (select |v_#memory_int_3084| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3084| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:36:26,159 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:26,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,235 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,235 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3085|]. (let ((.cse0 (select |v_#memory_int_3085| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3085| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 74))) [2019-05-15 10:36:26,235 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:26,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,314 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,314 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3086|]. (let ((.cse0 (select |v_#memory_int_3086| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_3086| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:26,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:36:26,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:26,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:26,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:26,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:26,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:26,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3087|]. (let ((.cse0 (select |v_#memory_int_3087| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= |#memory_int| (store |v_#memory_int_3087| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:26,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:36:26,463 INFO L273 TraceCheckUtils]: 0: Hoare triple {26348#true} havoc main_p1; {26348#true} is VALID [2019-05-15 10:36:26,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {26348#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {26348#true} is VALID [2019-05-15 10:36:26,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {26348#true} #memory_int := #memory_int[main_p1 := 0]; {26359#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:26,465 INFO L273 TraceCheckUtils]: 3: Hoare triple {26359#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26363#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:26,465 INFO L273 TraceCheckUtils]: 4: Hoare triple {26363#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26367#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:26,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {26367#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26371#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:26,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {26371#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26375#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:26,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {26375#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26379#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:26,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {26379#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26383#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:26,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {26383#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26387#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:26,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {26387#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26391#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:26,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {26391#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26395#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:26,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {26395#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26399#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:26,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {26399#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26403#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:26,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {26403#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26407#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:26,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {26407#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26411#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:26,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {26411#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26415#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:26,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {26415#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26419#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:26,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {26419#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26423#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:26,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {26423#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26427#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:26,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {26427#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26431#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:26,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {26431#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26435#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:26,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {26435#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26439#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:26,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {26439#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26443#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:26,480 INFO L273 TraceCheckUtils]: 24: Hoare triple {26443#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26447#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:26,481 INFO L273 TraceCheckUtils]: 25: Hoare triple {26447#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26451#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:26,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {26451#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26455#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:26,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {26455#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26459#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:26,483 INFO L273 TraceCheckUtils]: 28: Hoare triple {26459#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26463#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:26,484 INFO L273 TraceCheckUtils]: 29: Hoare triple {26463#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26467#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:26,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {26467#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26471#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:26,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {26471#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26475#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:26,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {26475#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26479#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:26,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {26479#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26483#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:26,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {26483#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26487#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:26,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {26487#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26491#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:26,510 INFO L273 TraceCheckUtils]: 36: Hoare triple {26491#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26495#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:26,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {26495#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26499#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:26,511 INFO L273 TraceCheckUtils]: 38: Hoare triple {26499#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26503#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:26,512 INFO L273 TraceCheckUtils]: 39: Hoare triple {26503#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26507#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:26,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {26507#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26511#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:26,513 INFO L273 TraceCheckUtils]: 41: Hoare triple {26511#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26515#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:26,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {26515#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26519#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:26,535 INFO L273 TraceCheckUtils]: 43: Hoare triple {26519#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26523#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:26,551 INFO L273 TraceCheckUtils]: 44: Hoare triple {26523#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26527#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:26,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {26527#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26531#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:26,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {26531#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26535#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:26,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {26535#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26539#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:26,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {26539#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26543#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:26,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {26543#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26547#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:26,617 INFO L273 TraceCheckUtils]: 50: Hoare triple {26547#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26551#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:26,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {26551#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26555#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:26,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {26555#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26559#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:26,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {26559#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26563#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:26,665 INFO L273 TraceCheckUtils]: 54: Hoare triple {26563#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26567#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:26,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {26567#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26571#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:26,677 INFO L273 TraceCheckUtils]: 56: Hoare triple {26571#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26575#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:26,677 INFO L273 TraceCheckUtils]: 57: Hoare triple {26575#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26579#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:26,678 INFO L273 TraceCheckUtils]: 58: Hoare triple {26579#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26583#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:26,678 INFO L273 TraceCheckUtils]: 59: Hoare triple {26583#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26587#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:26,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {26587#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26591#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:26,679 INFO L273 TraceCheckUtils]: 61: Hoare triple {26591#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26595#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:26,680 INFO L273 TraceCheckUtils]: 62: Hoare triple {26595#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26599#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:26,680 INFO L273 TraceCheckUtils]: 63: Hoare triple {26599#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26603#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:26,681 INFO L273 TraceCheckUtils]: 64: Hoare triple {26603#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26607#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:26,681 INFO L273 TraceCheckUtils]: 65: Hoare triple {26607#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26611#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:26,682 INFO L273 TraceCheckUtils]: 66: Hoare triple {26611#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26615#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:26,682 INFO L273 TraceCheckUtils]: 67: Hoare triple {26615#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26619#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:26,683 INFO L273 TraceCheckUtils]: 68: Hoare triple {26619#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26623#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:26,684 INFO L273 TraceCheckUtils]: 69: Hoare triple {26623#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26627#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:26,685 INFO L273 TraceCheckUtils]: 70: Hoare triple {26627#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26631#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:26,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {26631#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26635#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:26,686 INFO L273 TraceCheckUtils]: 72: Hoare triple {26635#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26639#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:26,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {26639#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26643#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:26,688 INFO L273 TraceCheckUtils]: 74: Hoare triple {26643#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26647#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:26,689 INFO L273 TraceCheckUtils]: 75: Hoare triple {26647#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26651#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:26,690 INFO L273 TraceCheckUtils]: 76: Hoare triple {26651#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26655#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:26,690 INFO L273 TraceCheckUtils]: 77: Hoare triple {26655#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26659#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:26,691 INFO L273 TraceCheckUtils]: 78: Hoare triple {26659#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26663#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:36:26,692 INFO L273 TraceCheckUtils]: 79: Hoare triple {26663#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {26667#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:36:26,693 INFO L273 TraceCheckUtils]: 80: Hoare triple {26667#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} assume !(#memory_int[main_p1] >= 0); {26349#false} is VALID [2019-05-15 10:36:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:26,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:26,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-15 10:36:26,702 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-05-15 10:36:26,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:26,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states. [2019-05-15 10:36:26,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:26,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-05-15 10:36:26,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-15 10:36:26,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:36:26,768 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 80 states. [2019-05-15 10:36:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,374 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-15 10:36:39,374 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 81 [2019-05-15 10:36:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:36:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:36:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-05-15 10:36:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-05-15 10:36:39,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2019-05-15 10:36:39,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:39,444 INFO L225 Difference]: With dead ends: 83 [2019-05-15 10:36:39,444 INFO L226 Difference]: Without dead ends: 83 [2019-05-15 10:36:39,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-05-15 10:36:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-05-15 10:36:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-05-15 10:36:39,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:39,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:39,446 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:39,446 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,447 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:39,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:39,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:39,447 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:39,448 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2019-05-15 10:36:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:39,449 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-05-15 10:36:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:39,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:39,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:39,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:39,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:36:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-05-15 10:36:39,450 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-05-15 10:36:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:39,450 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-05-15 10:36:39,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-05-15 10:36:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-05-15 10:36:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-05-15 10:36:39,450 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:39,450 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-05-15 10:36:39,451 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:39,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:39,451 INFO L82 PathProgramCache]: Analyzing trace with hash 165246536, now seen corresponding path program 78 times [2019-05-15 10:36:39,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:39,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-15 10:36:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:39,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:39,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:36:39,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:39,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3088|]. (= (store |v_#memory_int_3088| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:39,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:39,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,556 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,563 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,563 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3089|]. (let ((.cse0 (select |v_#memory_int_3089| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_3089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,563 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:39,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3090|]. (let ((.cse0 (select |v_#memory_int_3090| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_3090| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:39,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:39,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,603 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,603 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3091|]. (let ((.cse0 (select |v_#memory_int_3091| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,603 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:39,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3092|]. (let ((.cse0 (select |v_#memory_int_3092| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_3092| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:39,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:39,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3093|]. (let ((.cse0 (select |v_#memory_int_3093| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:39,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3094|]. (let ((.cse0 (select |v_#memory_int_3094| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3094| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:39,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:39,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,698 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3095|]. (let ((.cse0 (select |v_#memory_int_3095| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:39,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,722 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,722 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3096|]. (let ((.cse0 (select |v_#memory_int_3096| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3096| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:36:39,722 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:39,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3097|]. (let ((.cse0 (select |v_#memory_int_3097| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3097| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:39,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:39,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3098|]. (let ((.cse0 (select |v_#memory_int_3098| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,774 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:39,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,803 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3099|]. (let ((.cse0 (select |v_#memory_int_3099| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= |#memory_int| (store |v_#memory_int_3099| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:39,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:39,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3100|]. (let ((.cse0 (select |v_#memory_int_3100| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:36:39,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:39,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3101|]. (let ((.cse0 (select |v_#memory_int_3101| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:36:39,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:39,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3102|]. (let ((.cse0 (select |v_#memory_int_3102| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3102| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:36:39,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:39,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3103|]. (let ((.cse0 (select |v_#memory_int_3103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:36:39,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:39,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,952 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3104|]. (let ((.cse0 (select |v_#memory_int_3104| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:39,952 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:39,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:39,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:39,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:39,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:39,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:39,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3105|]. (let ((.cse0 (select |v_#memory_int_3105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:36:39,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:40,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,019 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3106|]. (let ((.cse0 (select |v_#memory_int_3106| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= |#memory_int| (store |v_#memory_int_3106| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:40,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3107|]. (let ((.cse0 (select |v_#memory_int_3107| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_3107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:40,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,090 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,090 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3108|]. (let ((.cse0 (select |v_#memory_int_3108| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:40,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,125 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3109|]. (let ((.cse0 (select |v_#memory_int_3109| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= |#memory_int| (store |v_#memory_int_3109| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,125 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:40,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3110|]. (let ((.cse0 (select |v_#memory_int_3110| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= |#memory_int| (store |v_#memory_int_3110| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:40,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,197 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3111|]. (let ((.cse0 (select |v_#memory_int_3111| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:36:40,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:40,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,237 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,237 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3112|]. (let ((.cse0 (select |v_#memory_int_3112| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_3112| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,237 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:40,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3113|]. (let ((.cse0 (select |v_#memory_int_3113| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:40,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,313 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,313 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3114|]. (let ((.cse0 (select |v_#memory_int_3114| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_3114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,314 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:40,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3115|]. (let ((.cse0 (select |v_#memory_int_3115| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_3115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:40,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3116|]. (let ((.cse0 (select |v_#memory_int_3116| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:40,426 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,438 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,438 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3117|]. (let ((.cse0 (select |v_#memory_int_3117| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:40,438 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:40,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,480 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,480 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3118|]. (let ((.cse0 (select |v_#memory_int_3118| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3118| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 29))) [2019-05-15 10:36:40,480 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:40,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3119|]. (let ((.cse0 (select |v_#memory_int_3119| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_3119| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:40,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3120|]. (let ((.cse0 (select |v_#memory_int_3120| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:40,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3121|]. (let ((.cse0 (select |v_#memory_int_3121| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3121| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:36:40,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:40,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,668 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,668 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3122|]. (let ((.cse0 (select |v_#memory_int_3122| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_3122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,669 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:40,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,713 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,713 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3123|]. (let ((.cse0 (select |v_#memory_int_3123| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= |#memory_int| (store |v_#memory_int_3123| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,713 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:40,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3124|]. (let ((.cse0 (select |v_#memory_int_3124| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_3124| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:40,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:40,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3125|]. (let ((.cse0 (select |v_#memory_int_3125| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_3125| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:40,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,863 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,863 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3126|]. (let ((.cse0 (select |v_#memory_int_3126| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= |#memory_int| (store |v_#memory_int_3126| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:40,863 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:40,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,912 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,912 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3127|]. (let ((.cse0 (select |v_#memory_int_3127| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3127| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 38))) [2019-05-15 10:36:40,912 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:40,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:40,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:40,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:40,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:40,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:40,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3128|]. (let ((.cse0 (select |v_#memory_int_3128| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3128| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:36:40,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:41,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3129|]. (let ((.cse0 (select |v_#memory_int_3129| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:41,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3130|]. (let ((.cse0 (select |v_#memory_int_3130| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3130| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:41,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3131|]. (let ((.cse0 (select |v_#memory_int_3131| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3131| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:41,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:41,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3132|]. (let ((.cse0 (select |v_#memory_int_3132| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:36:41,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:41,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,222 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,223 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3133|]. (let ((.cse0 (select |v_#memory_int_3133| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3133| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:36:41,223 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:41,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3134|]. (let ((.cse0 (select |v_#memory_int_3134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:36:41,279 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:41,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,337 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,337 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3135|]. (let ((.cse0 (select |v_#memory_int_3135| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:36:41,337 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:41,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,394 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3136|]. (let ((.cse0 (select |v_#memory_int_3136| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3136| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:36:41,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:41,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3137|]. (let ((.cse0 (select |v_#memory_int_3137| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:41,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:41,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,516 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,516 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3138|]. (let ((.cse0 (select |v_#memory_int_3138| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:41,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,573 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,573 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3139|]. (let ((.cse0 (select |v_#memory_int_3139| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3139| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,574 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:41,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,635 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3140|]. (let ((.cse0 (select |v_#memory_int_3140| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= |#memory_int| (store |v_#memory_int_3140| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:41,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:41,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3141|]. (let ((.cse0 (select |v_#memory_int_3141| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:41,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,757 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3142|]. (let ((.cse0 (select |v_#memory_int_3142| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,757 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:36:41,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3143|]. (let ((.cse0 (select |v_#memory_int_3143| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:36:41,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:36:41,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3144|]. (let ((.cse0 (select |v_#memory_int_3144| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_3144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:41,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:36:41,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:41,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:41,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:41,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:41,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:41,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3145|]. (let ((.cse0 (select |v_#memory_int_3145| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3145| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:36:41,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:36:42,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3146|]. (let ((.cse0 (select |v_#memory_int_3146| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:36:42,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,071 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3147|]. (let ((.cse0 (select |v_#memory_int_3147| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= |#memory_int| (store |v_#memory_int_3147| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:42,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:36:42,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3148|]. (let ((.cse0 (select |v_#memory_int_3148| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3148| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:36:42,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3149|]. (let ((.cse0 (select |v_#memory_int_3149| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_3149| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,214 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:36:42,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3150|]. (let ((.cse0 (select |v_#memory_int_3150| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3150| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:36:42,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:36:42,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3151|]. (let ((.cse0 (select |v_#memory_int_3151| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_3151| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:36:42,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,425 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,425 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3152|]. (let ((.cse0 (select |v_#memory_int_3152| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:36:42,425 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:36:42,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3153|]. (let ((.cse0 (select |v_#memory_int_3153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 64 .cse0))) [2019-05-15 10:36:42,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:36:42,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,568 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3154|]. (let ((.cse0 (select |v_#memory_int_3154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:36:42,568 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:36:42,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3155|]. (let ((.cse0 (select |v_#memory_int_3155| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3155| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:42,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:36:42,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,711 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,711 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3156|]. (let ((.cse0 (select |v_#memory_int_3156| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3156| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:36:42,711 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:36:42,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3157|]. (let ((.cse0 (select |v_#memory_int_3157| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:36:42,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3158|]. (let ((.cse0 (select |v_#memory_int_3158| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_3158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:36:42,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:42,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:42,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:42,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:42,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:42,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3159|]. (let ((.cse0 (select |v_#memory_int_3159| ULTIMATE.start_main_p1))) (and (= .cse0 70) (= (store |v_#memory_int_3159| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:42,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:36:43,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,017 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,017 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3160|]. (let ((.cse0 (select |v_#memory_int_3160| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3160| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 71))) [2019-05-15 10:36:43,017 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:36:43,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3161|]. (let ((.cse0 (select |v_#memory_int_3161| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:36:43,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:36:43,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,172 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,173 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3162|]. (let ((.cse0 (select |v_#memory_int_3162| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3162| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:36:43,173 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:36:43,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,255 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3163|]. (let ((.cse0 (select |v_#memory_int_3163| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= |#memory_int| (store |v_#memory_int_3163| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:43,255 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:36:43,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,336 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,336 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3164|]. (let ((.cse0 (select |v_#memory_int_3164| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= (store |v_#memory_int_3164| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:43,336 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:36:43,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,418 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3165|]. (let ((.cse0 (select |v_#memory_int_3165| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= |#memory_int| (store |v_#memory_int_3165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:43,418 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:36:43,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:43,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:43,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:43,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:43,505 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:43,505 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3166|]. (let ((.cse0 (select |v_#memory_int_3166| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3166| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:36:43,505 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:36:43,568 INFO L273 TraceCheckUtils]: 0: Hoare triple {27002#true} havoc main_p1; {27002#true} is VALID [2019-05-15 10:36:43,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {27002#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {27002#true} is VALID [2019-05-15 10:36:43,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {27002#true} #memory_int := #memory_int[main_p1 := 0]; {27013#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:36:43,570 INFO L273 TraceCheckUtils]: 3: Hoare triple {27013#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27017#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:36:43,570 INFO L273 TraceCheckUtils]: 4: Hoare triple {27017#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27021#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:36:43,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {27021#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27025#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:36:43,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {27025#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27029#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:36:43,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {27029#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27033#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:36:43,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {27033#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27037#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:36:43,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {27037#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27041#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:36:43,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {27041#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27045#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:36:43,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {27045#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27049#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:36:43,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {27049#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27053#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:36:43,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {27053#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27057#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:36:43,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {27057#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27061#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:36:43,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {27061#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27065#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:36:43,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {27065#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27069#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:36:43,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {27069#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27073#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:36:43,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {27073#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27077#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:36:43,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {27077#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27081#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:36:43,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {27081#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27085#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:36:43,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {27085#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27089#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:36:43,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {27089#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27093#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:36:43,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {27093#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27097#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:36:43,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {27097#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27101#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:36:43,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {27101#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27105#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:36:43,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {27105#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27109#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:36:43,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {27109#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27113#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:36:43,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {27113#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27117#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:36:43,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {27117#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27121#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:36:43,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {27121#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27125#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:36:43,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {27125#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27129#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:36:43,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {27129#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27133#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:36:43,591 INFO L273 TraceCheckUtils]: 33: Hoare triple {27133#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27137#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:36:43,592 INFO L273 TraceCheckUtils]: 34: Hoare triple {27137#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27141#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:36:43,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {27141#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27145#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:36:43,593 INFO L273 TraceCheckUtils]: 36: Hoare triple {27145#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27149#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:36:43,594 INFO L273 TraceCheckUtils]: 37: Hoare triple {27149#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27153#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:36:43,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {27153#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27157#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:36:43,596 INFO L273 TraceCheckUtils]: 39: Hoare triple {27157#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27161#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:36:43,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {27161#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27165#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:36:43,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {27165#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27169#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:36:43,598 INFO L273 TraceCheckUtils]: 42: Hoare triple {27169#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27173#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:36:43,598 INFO L273 TraceCheckUtils]: 43: Hoare triple {27173#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27177#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:36:43,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {27177#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27181#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:36:43,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {27181#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27185#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:36:43,601 INFO L273 TraceCheckUtils]: 46: Hoare triple {27185#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27189#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:36:43,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {27189#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27193#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:36:43,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {27193#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27197#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:36:43,603 INFO L273 TraceCheckUtils]: 49: Hoare triple {27197#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27201#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:36:43,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {27201#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27205#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:36:43,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {27205#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27209#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:36:43,605 INFO L273 TraceCheckUtils]: 52: Hoare triple {27209#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27213#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:36:43,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {27213#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27217#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:36:43,607 INFO L273 TraceCheckUtils]: 54: Hoare triple {27217#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27221#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:36:43,607 INFO L273 TraceCheckUtils]: 55: Hoare triple {27221#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27225#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:36:43,608 INFO L273 TraceCheckUtils]: 56: Hoare triple {27225#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27229#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:36:43,609 INFO L273 TraceCheckUtils]: 57: Hoare triple {27229#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27233#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:36:43,610 INFO L273 TraceCheckUtils]: 58: Hoare triple {27233#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27237#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:36:43,610 INFO L273 TraceCheckUtils]: 59: Hoare triple {27237#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27241#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:36:43,611 INFO L273 TraceCheckUtils]: 60: Hoare triple {27241#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27245#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:36:43,612 INFO L273 TraceCheckUtils]: 61: Hoare triple {27245#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27249#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:36:43,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {27249#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27253#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:36:43,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {27253#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27257#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:36:43,614 INFO L273 TraceCheckUtils]: 64: Hoare triple {27257#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27261#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:36:43,615 INFO L273 TraceCheckUtils]: 65: Hoare triple {27261#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27265#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:36:43,616 INFO L273 TraceCheckUtils]: 66: Hoare triple {27265#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27269#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:36:43,616 INFO L273 TraceCheckUtils]: 67: Hoare triple {27269#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27273#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:36:43,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {27273#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27277#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:36:43,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {27277#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27281#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:36:43,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {27281#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27285#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:36:43,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {27285#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27289#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:36:43,620 INFO L273 TraceCheckUtils]: 72: Hoare triple {27289#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27293#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:36:43,621 INFO L273 TraceCheckUtils]: 73: Hoare triple {27293#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27297#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:36:43,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {27297#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27301#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:36:43,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {27301#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27305#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:36:43,623 INFO L273 TraceCheckUtils]: 76: Hoare triple {27305#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27309#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:36:43,624 INFO L273 TraceCheckUtils]: 77: Hoare triple {27309#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27313#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:36:43,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {27313#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27317#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:36:43,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {27317#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27321#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:36:43,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {27321#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27325#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:36:43,627 INFO L273 TraceCheckUtils]: 81: Hoare triple {27325#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} assume !(#memory_int[main_p1] >= 0); {27003#false} is VALID [2019-05-15 10:36:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:36:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:36:43,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-15 10:36:43,636 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-05-15 10:36:43,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:36:43,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states. [2019-05-15 10:36:43,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:43,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-05-15 10:36:43,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-15 10:36:43,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-05-15 10:36:43,704 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 81 states. [2019-05-15 10:36:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,560 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:36:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-15 10:36:56,560 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 82 [2019-05-15 10:36:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:36:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:36:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-05-15 10:36:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-05-15 10:36:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-05-15 10:36:56,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 85 transitions. [2019-05-15 10:36:56,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:36:56,634 INFO L225 Difference]: With dead ends: 84 [2019-05-15 10:36:56,634 INFO L226 Difference]: Without dead ends: 84 [2019-05-15 10:36:56,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-05-15 10:36:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-05-15 10:36:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-05-15 10:36:56,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:36:56,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2019-05-15 10:36:56,636 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2019-05-15 10:36:56,636 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2019-05-15 10:36:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,637 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:36:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:36:56,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:56,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:56,637 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2019-05-15 10:36:56,637 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2019-05-15 10:36:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:36:56,638 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-05-15 10:36:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:36:56,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:36:56,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:36:56,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:36:56,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:36:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:36:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-05-15 10:36:56,639 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-05-15 10:36:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:36:56,640 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-05-15 10:36:56,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-05-15 10:36:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-05-15 10:36:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-05-15 10:36:56,640 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:36:56,640 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-05-15 10:36:56,640 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:36:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:36:56,640 INFO L82 PathProgramCache]: Analyzing trace with hash 827675266, now seen corresponding path program 79 times [2019-05-15 10:36:56,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:36:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:56,681 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-15 10:36:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:36:56,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:36:56,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:36:56,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:36:56,885 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3167|]. (= (store |v_#memory_int_3167| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:36:56,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:36:56,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,903 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3168|]. (let ((.cse0 (select |v_#memory_int_3168| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3168| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:56,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:36:56,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3169|]. (let ((.cse0 (select |v_#memory_int_3169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:36:56,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:36:56,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3170|]. (let ((.cse0 (select |v_#memory_int_3170| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:36:56,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,971 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,972 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3171|]. (let ((.cse0 (select |v_#memory_int_3171| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3171| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,972 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:36:56,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:56,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:56,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:56,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:56,995 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:56,995 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3172|]. (let ((.cse0 (select |v_#memory_int_3172| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:56,995 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:36:57,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,020 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,020 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3173|]. (let ((.cse0 (select |v_#memory_int_3173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:36:57,020 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:36:57,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3174|]. (let ((.cse0 (select |v_#memory_int_3174| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3174| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:36:57,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:36:57,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3175|]. (let ((.cse0 (select |v_#memory_int_3175| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_3175| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:36:57,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3176|]. (let ((.cse0 (select |v_#memory_int_3176| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_3176| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:36:57,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3177|]. (let ((.cse0 (select |v_#memory_int_3177| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:36:57,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,155 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3178|]. (let ((.cse0 (select |v_#memory_int_3178| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3178| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:36:57,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:36:57,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3179|]. (let ((.cse0 (select |v_#memory_int_3179| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:36:57,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:36:57,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,212 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3180|]. (let ((.cse0 (select |v_#memory_int_3180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:36:57,212 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:36:57,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,241 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,242 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3181|]. (let ((.cse0 (select |v_#memory_int_3181| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3181| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:36:57,242 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:36:57,260 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,272 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,273 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3182|]. (let ((.cse0 (select |v_#memory_int_3182| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= |#memory_int| (store |v_#memory_int_3182| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,273 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:36:57,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,306 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,306 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3183|]. (let ((.cse0 (select |v_#memory_int_3183| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_3183| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,306 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:36:57,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,340 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,341 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3184|]. (let ((.cse0 (select |v_#memory_int_3184| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3184| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:36:57,341 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:36:57,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3185|]. (let ((.cse0 (select |v_#memory_int_3185| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:36:57,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:36:57,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,416 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,416 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3186|]. (let ((.cse0 (select |v_#memory_int_3186| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,416 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:36:57,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,454 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3187|]. (let ((.cse0 (select |v_#memory_int_3187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:36:57,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:36:57,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3188|]. (let ((.cse0 (select |v_#memory_int_3188| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3188| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:36:57,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3189|]. (let ((.cse0 (select |v_#memory_int_3189| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3189| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:36:57,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:36:57,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,568 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,569 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3190|]. (let ((.cse0 (select |v_#memory_int_3190| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3190| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:36:57,569 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:36:57,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3191|]. (let ((.cse0 (select |v_#memory_int_3191| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3191| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:36:57,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:36:57,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,648 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,648 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3192|]. (let ((.cse0 (select |v_#memory_int_3192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:36:57,649 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:36:57,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3193|]. (let ((.cse0 (select |v_#memory_int_3193| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3193| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:36:57,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:36:57,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3194|]. (let ((.cse0 (select |v_#memory_int_3194| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3194| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:36:57,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:36:57,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,776 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,777 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3195|]. (let ((.cse0 (select |v_#memory_int_3195| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,777 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:36:57,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3196|]. (let ((.cse0 (select |v_#memory_int_3196| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3196| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:36:57,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:36:57,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,869 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,870 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3197|]. (let ((.cse0 (select |v_#memory_int_3197| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= (store |v_#memory_int_3197| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:57,870 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:36:57,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3198|]. (let ((.cse0 (select |v_#memory_int_3198| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_3198| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:57,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:36:57,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:57,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:57,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3199|]. (let ((.cse0 (select |v_#memory_int_3199| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3199| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 31))) [2019-05-15 10:36:57,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:36:57,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:57,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:57,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:57,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,002 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,002 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3200|]. (let ((.cse0 (select |v_#memory_int_3200| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3200| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 32))) [2019-05-15 10:36:58,002 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:36:58,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,048 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,049 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3201|]. (let ((.cse0 (select |v_#memory_int_3201| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_3201| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,049 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:36:58,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3202|]. (let ((.cse0 (select |v_#memory_int_3202| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_3202| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:36:58,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3203|]. (let ((.cse0 (select |v_#memory_int_3203| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:36:58,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:36:58,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,196 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,196 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3204|]. (let ((.cse0 (select |v_#memory_int_3204| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3204| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 36))) [2019-05-15 10:36:58,196 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:36:58,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,244 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3205|]. (let ((.cse0 (select |v_#memory_int_3205| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_3205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:58,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:36:58,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:58,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:58,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:58,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:58,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:58,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3206|]. (let ((.cse0 (select |v_#memory_int_3206| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3206| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:36:58,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:36:59,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3207|]. (let ((.cse0 (select |v_#memory_int_3207| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:36:59,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3208|]. (let ((.cse0 (select |v_#memory_int_3208| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_3208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:36:59,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,279 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,279 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3209|]. (let ((.cse0 (select |v_#memory_int_3209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:36:59,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:36:59,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3210|]. (let ((.cse0 (select |v_#memory_int_3210| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_3210| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:36:59,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,383 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,391 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3211|]. (let ((.cse0 (select |v_#memory_int_3211| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3211| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:36:59,391 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:36:59,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3212|]. (let ((.cse0 (select |v_#memory_int_3212| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_3212| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:36:59,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3213|]. (let ((.cse0 (select |v_#memory_int_3213| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= |#memory_int| (store |v_#memory_int_3213| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:36:59,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,558 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3214|]. (let ((.cse0 (select |v_#memory_int_3214| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:36:59,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:36:59,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,616 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3215|]. (let ((.cse0 (select |v_#memory_int_3215| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3215| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:36:59,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3216|]. (let ((.cse0 (select |v_#memory_int_3216| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3216| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:36:59,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:36:59,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,733 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,733 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3217|]. (let ((.cse0 (select |v_#memory_int_3217| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3217| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:36:59,733 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:36:59,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,799 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,799 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3218|]. (let ((.cse0 (select |v_#memory_int_3218| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:36:59,799 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:36:59,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,856 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,856 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3219|]. (let ((.cse0 (select |v_#memory_int_3219| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:36:59,856 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:36:59,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3220|]. (let ((.cse0 (select |v_#memory_int_3220| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_3220| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:36:59,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:36:59,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:36:59,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:36:59,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:36:59,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:36:59,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:36:59,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3221|]. (let ((.cse0 (select |v_#memory_int_3221| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3221| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:36:59,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:00,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,043 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3222|]. (let ((.cse0 (select |v_#memory_int_3222| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3222| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:37:00,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:00,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3223|]. (let ((.cse0 (select |v_#memory_int_3223| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:37:00,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:00,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,168 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3224|]. (let ((.cse0 (select |v_#memory_int_3224| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3224| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:00,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,234 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,234 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3225|]. (let ((.cse0 (select |v_#memory_int_3225| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3225| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,234 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:00,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3226|]. (let ((.cse0 (select |v_#memory_int_3226| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3226| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:00,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,370 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3227|]. (let ((.cse0 (select |v_#memory_int_3227| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3227| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,370 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:00,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,434 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3228|]. (let ((.cse0 (select |v_#memory_int_3228| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3228| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:37:00,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:00,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,503 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3229|]. (let ((.cse0 (select |v_#memory_int_3229| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3229| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:37:00,503 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:00,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,569 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,570 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3230|]. (let ((.cse0 (select |v_#memory_int_3230| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3230| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:37:00,570 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:00,631 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3231|]. (let ((.cse0 (select |v_#memory_int_3231| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:37:00,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:00,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3232|]. (let ((.cse0 (select |v_#memory_int_3232| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= (store |v_#memory_int_3232| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:00,709 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:00,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3233|]. (let ((.cse0 (select |v_#memory_int_3233| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3233| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 65))) [2019-05-15 10:37:00,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:00,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3234|]. (let ((.cse0 (select |v_#memory_int_3234| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3234| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 66 .cse0))) [2019-05-15 10:37:00,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:00,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:00,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:00,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3235|]. (let ((.cse0 (select |v_#memory_int_3235| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:37:00,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:00,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:00,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:00,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:00,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,000 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,000 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3236|]. (let ((.cse0 (select |v_#memory_int_3236| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:37:01,000 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:01,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3237|]. (let ((.cse0 (select |v_#memory_int_3237| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_3237| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:01,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3238|]. (let ((.cse0 (select |v_#memory_int_3238| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3238| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:37:01,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:01,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,225 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3239|]. (let ((.cse0 (select |v_#memory_int_3239| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:37:01,226 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:01,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3240|]. (let ((.cse0 (select |v_#memory_int_3240| ULTIMATE.start_main_p1))) (and (= .cse0 72) (= (store |v_#memory_int_3240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:01,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,378 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,378 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3241|]. (let ((.cse0 (select |v_#memory_int_3241| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= |#memory_int| (store |v_#memory_int_3241| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:01,379 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:01,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,459 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,459 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3242|]. (let ((.cse0 (select |v_#memory_int_3242| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= (store |v_#memory_int_3242| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,459 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:01,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,537 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3243|]. (let ((.cse0 (select |v_#memory_int_3243| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= (store |v_#memory_int_3243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:01,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,616 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3244|]. (let ((.cse0 (select |v_#memory_int_3244| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3244| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 76 .cse0))) [2019-05-15 10:37:01,616 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:01,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3245|]. (let ((.cse0 (select |v_#memory_int_3245| ULTIMATE.start_main_p1))) (and (= .cse0 77) (= (store |v_#memory_int_3245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:01,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:01,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:01,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:01,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:01,797 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:01,797 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3246|]. (let ((.cse0 (select |v_#memory_int_3246| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:01,797 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:01,867 INFO L273 TraceCheckUtils]: 0: Hoare triple {27664#true} havoc main_p1; {27664#true} is VALID [2019-05-15 10:37:01,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {27664#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {27664#true} is VALID [2019-05-15 10:37:01,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {27664#true} #memory_int := #memory_int[main_p1 := 0]; {27675#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:01,869 INFO L273 TraceCheckUtils]: 3: Hoare triple {27675#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27679#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:01,870 INFO L273 TraceCheckUtils]: 4: Hoare triple {27679#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27683#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:01,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {27683#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27687#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:01,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {27687#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27691#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:01,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {27691#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27695#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:01,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {27695#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27699#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:01,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {27699#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27703#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:01,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {27703#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27707#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:01,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {27707#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27711#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:01,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {27711#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27715#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:01,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {27715#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27719#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:01,882 INFO L273 TraceCheckUtils]: 14: Hoare triple {27719#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27723#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:01,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {27723#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27727#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:01,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {27727#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27731#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:01,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {27731#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27735#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:01,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {27735#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27739#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:01,885 INFO L273 TraceCheckUtils]: 19: Hoare triple {27739#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27743#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:01,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {27743#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27747#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:01,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {27747#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27751#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:01,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {27751#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27755#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:01,888 INFO L273 TraceCheckUtils]: 23: Hoare triple {27755#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27759#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:01,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {27759#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27763#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:01,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {27763#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27767#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:01,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {27767#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27771#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:01,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {27771#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27775#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:01,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {27775#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27779#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:01,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {27779#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27783#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:01,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {27783#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27787#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:01,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {27787#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27791#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:01,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {27791#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27795#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:01,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {27795#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27799#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:01,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {27799#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27803#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:01,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {27803#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27807#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:01,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {27807#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27811#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:01,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {27811#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27815#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:01,899 INFO L273 TraceCheckUtils]: 38: Hoare triple {27815#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27819#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:01,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {27819#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27823#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:01,901 INFO L273 TraceCheckUtils]: 40: Hoare triple {27823#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27827#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:01,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {27827#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27831#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:01,902 INFO L273 TraceCheckUtils]: 42: Hoare triple {27831#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27835#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:01,903 INFO L273 TraceCheckUtils]: 43: Hoare triple {27835#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27839#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:01,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {27839#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27843#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:01,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {27843#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27847#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:01,905 INFO L273 TraceCheckUtils]: 46: Hoare triple {27847#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27851#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:01,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {27851#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27855#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:01,907 INFO L273 TraceCheckUtils]: 48: Hoare triple {27855#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27859#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:01,908 INFO L273 TraceCheckUtils]: 49: Hoare triple {27859#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27863#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:01,909 INFO L273 TraceCheckUtils]: 50: Hoare triple {27863#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27867#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:01,909 INFO L273 TraceCheckUtils]: 51: Hoare triple {27867#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27871#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:01,910 INFO L273 TraceCheckUtils]: 52: Hoare triple {27871#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27875#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:01,911 INFO L273 TraceCheckUtils]: 53: Hoare triple {27875#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27879#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:01,912 INFO L273 TraceCheckUtils]: 54: Hoare triple {27879#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27883#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:01,912 INFO L273 TraceCheckUtils]: 55: Hoare triple {27883#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27887#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:01,913 INFO L273 TraceCheckUtils]: 56: Hoare triple {27887#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27891#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:01,914 INFO L273 TraceCheckUtils]: 57: Hoare triple {27891#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27895#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:01,915 INFO L273 TraceCheckUtils]: 58: Hoare triple {27895#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27899#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:01,915 INFO L273 TraceCheckUtils]: 59: Hoare triple {27899#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27903#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:01,916 INFO L273 TraceCheckUtils]: 60: Hoare triple {27903#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27907#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:01,917 INFO L273 TraceCheckUtils]: 61: Hoare triple {27907#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27911#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:01,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {27911#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27915#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:01,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {27915#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27919#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:01,919 INFO L273 TraceCheckUtils]: 64: Hoare triple {27919#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27923#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:01,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {27923#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27927#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:01,921 INFO L273 TraceCheckUtils]: 66: Hoare triple {27927#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27931#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:01,921 INFO L273 TraceCheckUtils]: 67: Hoare triple {27931#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27935#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:01,922 INFO L273 TraceCheckUtils]: 68: Hoare triple {27935#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27939#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:01,923 INFO L273 TraceCheckUtils]: 69: Hoare triple {27939#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27943#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:01,924 INFO L273 TraceCheckUtils]: 70: Hoare triple {27943#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27947#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:01,924 INFO L273 TraceCheckUtils]: 71: Hoare triple {27947#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27951#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:01,925 INFO L273 TraceCheckUtils]: 72: Hoare triple {27951#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27955#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:01,926 INFO L273 TraceCheckUtils]: 73: Hoare triple {27955#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27959#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:01,927 INFO L273 TraceCheckUtils]: 74: Hoare triple {27959#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27963#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:01,927 INFO L273 TraceCheckUtils]: 75: Hoare triple {27963#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27967#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:01,928 INFO L273 TraceCheckUtils]: 76: Hoare triple {27967#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27971#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:01,929 INFO L273 TraceCheckUtils]: 77: Hoare triple {27971#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27975#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:01,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {27975#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27979#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:01,930 INFO L273 TraceCheckUtils]: 79: Hoare triple {27979#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27983#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:01,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {27983#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27987#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:01,932 INFO L273 TraceCheckUtils]: 81: Hoare triple {27987#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {27991#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:01,932 INFO L273 TraceCheckUtils]: 82: Hoare triple {27991#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} assume !(#memory_int[main_p1] >= 0); {27665#false} is VALID [2019-05-15 10:37:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:01,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:01,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-15 10:37:01,942 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-05-15 10:37:01,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:01,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states. [2019-05-15 10:37:02,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:02,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-05-15 10:37:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-15 10:37:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:37:02,011 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 82 states. [2019-05-15 10:37:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:15,231 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-15 10:37:15,232 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 83 [2019-05-15 10:37:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:37:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:37:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-05-15 10:37:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-05-15 10:37:15,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2019-05-15 10:37:15,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:15,302 INFO L225 Difference]: With dead ends: 85 [2019-05-15 10:37:15,303 INFO L226 Difference]: Without dead ends: 85 [2019-05-15 10:37:15,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-05-15 10:37:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-05-15 10:37:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-05-15 10:37:15,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:15,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:15,305 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:15,305 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:15,306 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:15,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:15,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:15,306 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:15,306 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2019-05-15 10:37:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:15,307 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-05-15 10:37:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:15,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:15,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:15,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:15,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:37:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-05-15 10:37:15,308 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-05-15 10:37:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:15,308 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-05-15 10:37:15,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-05-15 10:37:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-05-15 10:37:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-05-15 10:37:15,309 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:15,309 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-05-15 10:37:15,309 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash -111870584, now seen corresponding path program 80 times [2019-05-15 10:37:15,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:15,347 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-15 10:37:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:15,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:15,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:37:15,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:15,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3247|]. (= (store |v_#memory_int_3247| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:15,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:15,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,408 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,408 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3248|]. (let ((.cse0 (select |v_#memory_int_3248| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3248| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:15,408 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:15,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3249|]. (let ((.cse0 (select |v_#memory_int_3249| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= |#memory_int| (store |v_#memory_int_3249| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:15,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:15,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,449 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3250|]. (let ((.cse0 (select |v_#memory_int_3250| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_3250| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:15,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:15,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,472 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,472 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3251|]. (let ((.cse0 (select |v_#memory_int_3251| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,472 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:15,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3252|]. (let ((.cse0 (select |v_#memory_int_3252| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3252| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:37:15,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:15,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3253|]. (let ((.cse0 (select |v_#memory_int_3253| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3253| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:37:15,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:15,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,542 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3254|]. (let ((.cse0 (select |v_#memory_int_3254| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3254| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:37:15,542 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:15,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,567 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,567 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3255|]. (let ((.cse0 (select |v_#memory_int_3255| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3255| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:37:15,567 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:15,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3256|]. (let ((.cse0 (select |v_#memory_int_3256| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3256| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:37:15,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:15,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,619 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,619 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3257|]. (let ((.cse0 (select |v_#memory_int_3257| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:37:15,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:15,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,650 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3258|]. (let ((.cse0 (select |v_#memory_int_3258| ULTIMATE.start_main_p1))) (and (= 10 .cse0) (= (store |v_#memory_int_3258| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37:15,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,679 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,679 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3259|]. (let ((.cse0 (select |v_#memory_int_3259| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3259| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,679 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:15,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3260|]. (let ((.cse0 (select |v_#memory_int_3260| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_3260| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:15,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:15,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3261|]. (let ((.cse0 (select |v_#memory_int_3261| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3261| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:37:15,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:15,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3262|]. (let ((.cse0 (select |v_#memory_int_3262| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3262| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 14 .cse0))) [2019-05-15 10:37:15,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:15,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,798 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,798 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3263|]. (let ((.cse0 (select |v_#memory_int_3263| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:37:15,798 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:15,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3264|]. (let ((.cse0 (select |v_#memory_int_3264| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3264| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:37:15,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:15,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3265|]. (let ((.cse0 (select |v_#memory_int_3265| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3265| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:37:15,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:15,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,897 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3266|]. (let ((.cse0 (select |v_#memory_int_3266| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= (store |v_#memory_int_3266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,897 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:15,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3267|]. (let ((.cse0 (select |v_#memory_int_3267| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:15,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:15,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:15,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:15,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:15,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:15,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:15,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3268|]. (let ((.cse0 (select |v_#memory_int_3268| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3268| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 20 .cse0))) [2019-05-15 10:37:15,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:15,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3269|]. (let ((.cse0 (select |v_#memory_int_3269| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_3269| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:16,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3270|]. (let ((.cse0 (select |v_#memory_int_3270| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_3270| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:16,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3271|]. (let ((.cse0 (select |v_#memory_int_3271| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3271| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:37:16,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:16,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,138 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,138 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3272|]. (let ((.cse0 (select |v_#memory_int_3272| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3272| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:37:16,139 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:16,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3273|]. (let ((.cse0 (select |v_#memory_int_3273| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= |#memory_int| (store |v_#memory_int_3273| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:16,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3274|]. (let ((.cse0 (select |v_#memory_int_3274| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= (store |v_#memory_int_3274| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:16,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3275|]. (let ((.cse0 (select |v_#memory_int_3275| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3275| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:37:16,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:16,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,301 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,302 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3276|]. (let ((.cse0 (select |v_#memory_int_3276| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3276| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 28))) [2019-05-15 10:37:16,302 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:16,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3277|]. (let ((.cse0 (select |v_#memory_int_3277| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= |#memory_int| (store |v_#memory_int_3277| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:16,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,388 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,388 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3278|]. (let ((.cse0 (select |v_#memory_int_3278| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_3278| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,388 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:16,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3279|]. (let ((.cse0 (select |v_#memory_int_3279| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3279| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:16,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,479 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3280|]. (let ((.cse0 (select |v_#memory_int_3280| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3280| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:16,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,525 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,525 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3281|]. (let ((.cse0 (select |v_#memory_int_3281| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_3281| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:16,525 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:16,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3282|]. (let ((.cse0 (select |v_#memory_int_3282| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3282| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:37:16,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:16,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3283|]. (let ((.cse0 (select |v_#memory_int_3283| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3283| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:37:16,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37:16,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,664 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,672 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,672 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3284|]. (let ((.cse0 (select |v_#memory_int_3284| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3284| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:37:16,672 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37:16,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3285|]. (let ((.cse0 (select |v_#memory_int_3285| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3285| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:37:16,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:16,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,773 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3286|]. (let ((.cse0 (select |v_#memory_int_3286| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= |#memory_int| (store |v_#memory_int_3286| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,773 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:16,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3287|]. (let ((.cse0 (select |v_#memory_int_3287| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_3287| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:16,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:16,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3288|]. (let ((.cse0 (select |v_#memory_int_3288| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3288| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:37:16,877 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:16,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3289|]. (let ((.cse0 (select |v_#memory_int_3289| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3289| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:37:16,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:16,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:16,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:16,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:16,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:16,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:16,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3290|]. (let ((.cse0 (select |v_#memory_int_3290| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3290| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:37:16,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37:17,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,041 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,041 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3291|]. (let ((.cse0 (select |v_#memory_int_3291| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3291| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:37:17,041 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:17,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,096 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,096 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3292|]. (let ((.cse0 (select |v_#memory_int_3292| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3292| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:37:17,096 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:17,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,153 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,154 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3293|]. (let ((.cse0 (select |v_#memory_int_3293| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3293| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:37:17,154 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:17,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,207 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3294|]. (let ((.cse0 (select |v_#memory_int_3294| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3294| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:37:17,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:17,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,265 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3295|]. (let ((.cse0 (select |v_#memory_int_3295| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3295| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,265 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:17,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,323 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,323 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3296|]. (let ((.cse0 (select |v_#memory_int_3296| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3296| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:37:17,323 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:17,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,382 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3297|]. (let ((.cse0 (select |v_#memory_int_3297| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3297| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:37:17,382 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:17,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3298|]. (let ((.cse0 (select |v_#memory_int_3298| ULTIMATE.start_main_p1))) (and (= 50 .cse0) (= (store |v_#memory_int_3298| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:17,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,498 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3299|]. (let ((.cse0 (select |v_#memory_int_3299| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3299| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,498 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:17,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,559 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3300|]. (let ((.cse0 (select |v_#memory_int_3300| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3300| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:17,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3301|]. (let ((.cse0 (select |v_#memory_int_3301| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= |#memory_int| (store |v_#memory_int_3301| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:17,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:17,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3302|]. (let ((.cse0 (select |v_#memory_int_3302| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3302| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 54 .cse0))) [2019-05-15 10:37:17,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:17,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3303|]. (let ((.cse0 (select |v_#memory_int_3303| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_3303| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:17,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:17,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3304|]. (let ((.cse0 (select |v_#memory_int_3304| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3304| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:37:17,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:17,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3305|]. (let ((.cse0 (select |v_#memory_int_3305| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3305| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 57))) [2019-05-15 10:37:17,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:17,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:17,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:17,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:17,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:17,951 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:17,951 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3306|]. (let ((.cse0 (select |v_#memory_int_3306| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= (store |v_#memory_int_3306| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:17,951 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:18,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3307|]. (let ((.cse0 (select |v_#memory_int_3307| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3307| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:18,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,079 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,079 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3308|]. (let ((.cse0 (select |v_#memory_int_3308| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= (store |v_#memory_int_3308| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,079 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:18,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3309|]. (let ((.cse0 (select |v_#memory_int_3309| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_3309| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:18,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,219 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3310|]. (let ((.cse0 (select |v_#memory_int_3310| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= (store |v_#memory_int_3310| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:18,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3311|]. (let ((.cse0 (select |v_#memory_int_3311| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= |#memory_int| (store |v_#memory_int_3311| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:18,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:18,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,365 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3312|]. (let ((.cse0 (select |v_#memory_int_3312| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3312| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:37:18,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:18,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,440 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3313|]. (let ((.cse0 (select |v_#memory_int_3313| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3313| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:18,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3314|]. (let ((.cse0 (select |v_#memory_int_3314| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3314| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:37:18,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:18,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3315|]. (let ((.cse0 (select |v_#memory_int_3315| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_3315| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,586 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:18,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,660 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3316|]. (let ((.cse0 (select |v_#memory_int_3316| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= |#memory_int| (store |v_#memory_int_3316| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:18,660 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:18,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,730 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,730 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3317|]. (let ((.cse0 (select |v_#memory_int_3317| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_3317| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,730 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:18,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,803 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,811 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3318|]. (let ((.cse0 (select |v_#memory_int_3318| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3318| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:37:18,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:18,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3319|]. (let ((.cse0 (select |v_#memory_int_3319| ULTIMATE.start_main_p1))) (and (= .cse0 71) (= (store |v_#memory_int_3319| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:18,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:18,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:18,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:18,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:18,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:18,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:18,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3320|]. (let ((.cse0 (select |v_#memory_int_3320| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3320| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 72 .cse0))) [2019-05-15 10:37:18,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:19,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,040 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3321|]. (let ((.cse0 (select |v_#memory_int_3321| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3321| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:37:19,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:19,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3322|]. (let ((.cse0 (select |v_#memory_int_3322| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3322| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:37:19,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:19,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,195 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3323|]. (let ((.cse0 (select |v_#memory_int_3323| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3323| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:37:19,195 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:19,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,274 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,274 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3324|]. (let ((.cse0 (select |v_#memory_int_3324| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3324| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 76))) [2019-05-15 10:37:19,274 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:19,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,347 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3325|]. (let ((.cse0 (select |v_#memory_int_3325| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3325| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:37:19,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:19,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3326|]. (let ((.cse0 (select |v_#memory_int_3326| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3326| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:37:19,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:19,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:19,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:19,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:19,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:19,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:19,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3327|]. (let ((.cse0 (select |v_#memory_int_3327| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3327| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:19,520 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:37:19,584 INFO L273 TraceCheckUtils]: 0: Hoare triple {28334#true} havoc main_p1; {28334#true} is VALID [2019-05-15 10:37:19,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {28334#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {28334#true} is VALID [2019-05-15 10:37:19,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {28334#true} #memory_int := #memory_int[main_p1 := 0]; {28345#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:19,586 INFO L273 TraceCheckUtils]: 3: Hoare triple {28345#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28349#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:19,586 INFO L273 TraceCheckUtils]: 4: Hoare triple {28349#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28353#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:19,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {28353#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28357#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:19,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {28357#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28361#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:19,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {28361#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28365#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:19,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {28365#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28369#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:19,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {28369#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28373#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:19,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {28373#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28377#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:19,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {28377#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28381#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:19,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {28381#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28385#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:19,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {28385#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28389#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:19,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {28389#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28393#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:19,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {28393#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28397#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:19,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {28397#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28401#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:19,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {28401#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28405#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:19,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {28405#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28409#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:19,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {28409#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28413#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:19,598 INFO L273 TraceCheckUtils]: 20: Hoare triple {28413#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28417#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:19,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {28417#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28421#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:19,600 INFO L273 TraceCheckUtils]: 22: Hoare triple {28421#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28425#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:19,600 INFO L273 TraceCheckUtils]: 23: Hoare triple {28425#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28429#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:19,601 INFO L273 TraceCheckUtils]: 24: Hoare triple {28429#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28433#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:19,602 INFO L273 TraceCheckUtils]: 25: Hoare triple {28433#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28437#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:19,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {28437#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28441#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:19,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {28441#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28445#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:19,604 INFO L273 TraceCheckUtils]: 28: Hoare triple {28445#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28449#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:19,605 INFO L273 TraceCheckUtils]: 29: Hoare triple {28449#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28453#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:19,606 INFO L273 TraceCheckUtils]: 30: Hoare triple {28453#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28457#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:19,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {28457#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28461#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:19,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {28461#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28465#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:19,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {28465#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28469#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:19,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {28469#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28473#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:19,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {28473#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28477#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:19,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {28477#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28481#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:19,611 INFO L273 TraceCheckUtils]: 37: Hoare triple {28481#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28485#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:19,612 INFO L273 TraceCheckUtils]: 38: Hoare triple {28485#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28489#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:19,612 INFO L273 TraceCheckUtils]: 39: Hoare triple {28489#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28493#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:19,613 INFO L273 TraceCheckUtils]: 40: Hoare triple {28493#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28497#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:19,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {28497#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28501#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:19,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {28501#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28505#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:19,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {28505#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28509#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:19,616 INFO L273 TraceCheckUtils]: 44: Hoare triple {28509#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28513#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:19,617 INFO L273 TraceCheckUtils]: 45: Hoare triple {28513#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28517#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:19,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {28517#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28521#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:19,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {28521#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28525#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:19,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {28525#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28529#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:19,620 INFO L273 TraceCheckUtils]: 49: Hoare triple {28529#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28533#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:19,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {28533#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28537#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:19,621 INFO L273 TraceCheckUtils]: 51: Hoare triple {28537#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28541#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:19,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {28541#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28545#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:19,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {28545#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28549#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:19,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {28549#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28553#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:19,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {28553#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28557#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:19,625 INFO L273 TraceCheckUtils]: 56: Hoare triple {28557#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28561#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:19,626 INFO L273 TraceCheckUtils]: 57: Hoare triple {28561#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28565#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:19,627 INFO L273 TraceCheckUtils]: 58: Hoare triple {28565#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28569#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:19,627 INFO L273 TraceCheckUtils]: 59: Hoare triple {28569#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28573#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:19,628 INFO L273 TraceCheckUtils]: 60: Hoare triple {28573#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28577#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:19,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {28577#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28581#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:19,630 INFO L273 TraceCheckUtils]: 62: Hoare triple {28581#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28585#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:19,630 INFO L273 TraceCheckUtils]: 63: Hoare triple {28585#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28589#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:19,631 INFO L273 TraceCheckUtils]: 64: Hoare triple {28589#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28593#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:19,632 INFO L273 TraceCheckUtils]: 65: Hoare triple {28593#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28597#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:19,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {28597#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28601#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:19,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {28601#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28605#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:19,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {28605#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28609#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:19,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {28609#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28613#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:19,636 INFO L273 TraceCheckUtils]: 70: Hoare triple {28613#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28617#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:19,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {28617#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28621#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:19,637 INFO L273 TraceCheckUtils]: 72: Hoare triple {28621#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28625#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:19,638 INFO L273 TraceCheckUtils]: 73: Hoare triple {28625#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28629#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:19,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {28629#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28633#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:19,639 INFO L273 TraceCheckUtils]: 75: Hoare triple {28633#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28637#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:19,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {28637#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28641#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:19,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {28641#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28645#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:19,642 INFO L273 TraceCheckUtils]: 78: Hoare triple {28645#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28649#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:19,642 INFO L273 TraceCheckUtils]: 79: Hoare triple {28649#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28653#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:19,643 INFO L273 TraceCheckUtils]: 80: Hoare triple {28653#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28657#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:19,644 INFO L273 TraceCheckUtils]: 81: Hoare triple {28657#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28661#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:19,645 INFO L273 TraceCheckUtils]: 82: Hoare triple {28661#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {28665#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:37:19,645 INFO L273 TraceCheckUtils]: 83: Hoare triple {28665#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} assume !(#memory_int[main_p1] >= 0); {28335#false} is VALID [2019-05-15 10:37:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:19,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:19,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-15 10:37:19,654 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-05-15 10:37:19,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:19,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states. [2019-05-15 10:37:19,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:19,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-05-15 10:37:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-15 10:37:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-05-15 10:37:19,722 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 83 states. [2019-05-15 10:37:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:33,295 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-15 10:37:33,295 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 84 [2019-05-15 10:37:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:33,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:37:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-05-15 10:37:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-05-15 10:37:33,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-05-15 10:37:33,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 83 states and 87 transitions. [2019-05-15 10:37:33,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:33,366 INFO L225 Difference]: With dead ends: 86 [2019-05-15 10:37:33,366 INFO L226 Difference]: Without dead ends: 86 [2019-05-15 10:37:33,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-05-15 10:37:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-05-15 10:37:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-05-15 10:37:33,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:33,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:33,368 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:33,368 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:33,368 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:33,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:33,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:33,369 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:33,369 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2019-05-15 10:37:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:33,370 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-05-15 10:37:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:33,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:33,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:33,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:33,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:37:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-05-15 10:37:33,371 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-05-15 10:37:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:33,371 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-05-15 10:37:33,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-05-15 10:37:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-05-15 10:37:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-05-15 10:37:33,371 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:33,372 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-05-15 10:37:33,372 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:33,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash 826979138, now seen corresponding path program 81 times [2019-05-15 10:37:33,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:33,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-15 10:37:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:33,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:33,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:37:33,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:33,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,633 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3328|]. (= (store |v_#memory_int_3328| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:33,633 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:33,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:33,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:33,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:33,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:33,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:33,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3329|]. (let ((.cse0 (select |v_#memory_int_3329| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3329| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:37:33,910 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:34,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,229 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3330|]. (let ((.cse0 (select |v_#memory_int_3330| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3330| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:37:34,229 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:34,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,545 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3331|]. (let ((.cse0 (select |v_#memory_int_3331| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3331| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:37:34,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:34,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,860 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3332|]. (let ((.cse0 (select |v_#memory_int_3332| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3332| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:34,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:34,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:34,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:34,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:34,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:34,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3333|]. (let ((.cse0 (select |v_#memory_int_3333| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_3333| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:34,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:34,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3334|]. (let ((.cse0 (select |v_#memory_int_3334| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_3334| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:35,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3335|]. (let ((.cse0 (select |v_#memory_int_3335| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3335| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:37:35,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:35,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3336|]. (let ((.cse0 (select |v_#memory_int_3336| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3336| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:37:35,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:35,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3337|]. (let ((.cse0 (select |v_#memory_int_3337| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_3337| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:35,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3338|]. (let ((.cse0 (select |v_#memory_int_3338| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3338| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:37:35,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:35,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3339|]. (let ((.cse0 (select |v_#memory_int_3339| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3339| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:37:35,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37:35,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,427 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3340|]. (let ((.cse0 (select |v_#memory_int_3340| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3340| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:37:35,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:35,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,455 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,455 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3341|]. (let ((.cse0 (select |v_#memory_int_3341| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3341| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:37:35,455 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:35,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,485 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,485 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3342|]. (let ((.cse0 (select |v_#memory_int_3342| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3342| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 13 .cse0))) [2019-05-15 10:37:35,485 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:35,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,515 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3343|]. (let ((.cse0 (select |v_#memory_int_3343| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3343| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 14))) [2019-05-15 10:37:35,516 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:35,535 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,544 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,545 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3344|]. (let ((.cse0 (select |v_#memory_int_3344| ULTIMATE.start_main_p1))) (and (= 15 .cse0) (= (store |v_#memory_int_3344| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,545 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:35,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,578 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3345|]. (let ((.cse0 (select |v_#memory_int_3345| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_3345| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,578 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:35,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3346|]. (let ((.cse0 (select |v_#memory_int_3346| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_3346| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:35,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,646 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,647 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3347|]. (let ((.cse0 (select |v_#memory_int_3347| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3347| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:37:35,647 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:35,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3348|]. (let ((.cse0 (select |v_#memory_int_3348| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3348| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:37:35,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:35,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,716 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3349|]. (let ((.cse0 (select |v_#memory_int_3349| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3349| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:37:35,717 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:35,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,757 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3350|]. (let ((.cse0 (select |v_#memory_int_3350| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_3350| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:35,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3351|]. (let ((.cse0 (select |v_#memory_int_3351| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3351| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:37:35,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:35,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3352|]. (let ((.cse0 (select |v_#memory_int_3352| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3352| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:35,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,871 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,871 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3353|]. (let ((.cse0 (select |v_#memory_int_3353| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3353| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,871 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:35,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3354|]. (let ((.cse0 (select |v_#memory_int_3354| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3354| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 25))) [2019-05-15 10:37:35,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:35,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,948 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,948 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3355|]. (let ((.cse0 (select |v_#memory_int_3355| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3355| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:37:35,948 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:35,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:35,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:35,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:35,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:35,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:35,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3356|]. (let ((.cse0 (select |v_#memory_int_3356| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3356| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:35,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:36,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3357|]. (let ((.cse0 (select |v_#memory_int_3357| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3357| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:37:36,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:36,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,073 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3358|]. (let ((.cse0 (select |v_#memory_int_3358| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3358| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:37:36,073 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:36,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,119 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,119 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3359|]. (let ((.cse0 (select |v_#memory_int_3359| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3359| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 30 .cse0))) [2019-05-15 10:37:36,119 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:36,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3360|]. (let ((.cse0 (select |v_#memory_int_3360| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3360| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:36,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3361|]. (let ((.cse0 (select |v_#memory_int_3361| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3361| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:36,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,255 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3362|]. (let ((.cse0 (select |v_#memory_int_3362| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3362| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:37:36,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:36,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3363|]. (let ((.cse0 (select |v_#memory_int_3363| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3363| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:37:36,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:36,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3364|]. (let ((.cse0 (select |v_#memory_int_3364| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3364| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:37:36,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37:36,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3365|]. (let ((.cse0 (select |v_#memory_int_3365| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3365| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:37:36,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37:36,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,452 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,452 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3366|]. (let ((.cse0 (select |v_#memory_int_3366| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_3366| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,452 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:36,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3367|]. (let ((.cse0 (select |v_#memory_int_3367| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3367| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:37:36,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:36,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,556 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3368|]. (let ((.cse0 (select |v_#memory_int_3368| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3368| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:36,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3369|]. (let ((.cse0 (select |v_#memory_int_3369| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3369| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:36,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:36,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3370|]. (let ((.cse0 (select |v_#memory_int_3370| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3370| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 41))) [2019-05-15 10:37:36,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:36,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3371|]. (let ((.cse0 (select |v_#memory_int_3371| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3371| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:37:36,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37:36,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3372|]. (let ((.cse0 (select |v_#memory_int_3372| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3372| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 43))) [2019-05-15 10:37:36,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:36,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3373|]. (let ((.cse0 (select |v_#memory_int_3373| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3373| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:37:36,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:36,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,889 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3374|]. (let ((.cse0 (select |v_#memory_int_3374| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3374| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:37:36,889 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:36,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:36,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:36,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:36,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:36,946 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:36,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3375|]. (let ((.cse0 (select |v_#memory_int_3375| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3375| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:37:36,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:36,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,011 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,011 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3376|]. (let ((.cse0 (select |v_#memory_int_3376| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3376| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:37,011 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:37,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3377|]. (let ((.cse0 (select |v_#memory_int_3377| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3377| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:37:37,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:37,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,125 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,126 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3378|]. (let ((.cse0 (select |v_#memory_int_3378| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3378| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:37,126 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:37,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,186 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3379|]. (let ((.cse0 (select |v_#memory_int_3379| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3379| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:37:37,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:37,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,245 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,245 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3380|]. (let ((.cse0 (select |v_#memory_int_3380| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3380| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:37:37,245 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:37,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,307 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,307 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3381|]. (let ((.cse0 (select |v_#memory_int_3381| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= |#memory_int| (store |v_#memory_int_3381| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:37,307 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:37,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3382|]. (let ((.cse0 (select |v_#memory_int_3382| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3382| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 53))) [2019-05-15 10:37:37,368 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:37,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,428 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3383|]. (let ((.cse0 (select |v_#memory_int_3383| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= |#memory_int| (store |v_#memory_int_3383| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:37,428 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:37,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3384|]. (let ((.cse0 (select |v_#memory_int_3384| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3384| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:37:37,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:37,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,556 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3385|]. (let ((.cse0 (select |v_#memory_int_3385| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3385| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:37:37,557 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:37,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,628 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,628 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3386|]. (let ((.cse0 (select |v_#memory_int_3386| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3386| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:37:37,628 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:37,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3387|]. (let ((.cse0 (select |v_#memory_int_3387| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3387| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:37:37,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:37,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,758 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,758 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3388|]. (let ((.cse0 (select |v_#memory_int_3388| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3388| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 59 .cse0))) [2019-05-15 10:37:37,758 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:37,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,826 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3389|]. (let ((.cse0 (select |v_#memory_int_3389| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3389| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:37,826 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:37,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,894 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,894 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3390|]. (let ((.cse0 (select |v_#memory_int_3390| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3390| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:37:37,894 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:37,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:37,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:37,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:37,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:37,963 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:37,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3391|]. (let ((.cse0 (select |v_#memory_int_3391| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3391| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 62))) [2019-05-15 10:37:37,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:38,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,034 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,034 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3392|]. (let ((.cse0 (select |v_#memory_int_3392| ULTIMATE.start_main_p1))) (and (= 63 .cse0) (= (store |v_#memory_int_3392| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:38,034 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:38,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3393|]. (let ((.cse0 (select |v_#memory_int_3393| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3393| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 64 .cse0))) [2019-05-15 10:37:38,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:38,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,176 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,177 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3394|]. (let ((.cse0 (select |v_#memory_int_3394| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= (store |v_#memory_int_3394| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:38,177 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:38,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3395|]. (let ((.cse0 (select |v_#memory_int_3395| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3395| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:37:38,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:38,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,319 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,320 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3396|]. (let ((.cse0 (select |v_#memory_int_3396| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3396| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 67))) [2019-05-15 10:37:38,320 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:38,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,399 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,399 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3397|]. (let ((.cse0 (select |v_#memory_int_3397| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= (store |v_#memory_int_3397| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:38,399 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:38,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3398|]. (let ((.cse0 (select |v_#memory_int_3398| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3398| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:37:38,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:38,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3399|]. (let ((.cse0 (select |v_#memory_int_3399| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3399| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 70 .cse0))) [2019-05-15 10:37:38,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:38,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,622 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,622 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3400|]. (let ((.cse0 (select |v_#memory_int_3400| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= (store |v_#memory_int_3400| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:38,622 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:38,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,701 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3401|]. (let ((.cse0 (select |v_#memory_int_3401| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3401| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:37:38,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:38,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,782 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,782 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3402|]. (let ((.cse0 (select |v_#memory_int_3402| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= |#memory_int| (store |v_#memory_int_3402| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:38,782 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:38,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3403|]. (let ((.cse0 (select |v_#memory_int_3403| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= (store |v_#memory_int_3403| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:38,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:38,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:38,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:38,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:38,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:38,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:38,937 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3404|]. (let ((.cse0 (select |v_#memory_int_3404| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_3404| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:38,937 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:39,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:39,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:39,018 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,019 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3405|]. (let ((.cse0 (select |v_#memory_int_3405| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3405| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:39,019 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:39,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:39,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:39,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3406|]. (let ((.cse0 (select |v_#memory_int_3406| ULTIMATE.start_main_p1))) (and (= 77 .cse0) (= (store |v_#memory_int_3406| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:39,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:39,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:39,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:39,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3407|]. (let ((.cse0 (select |v_#memory_int_3407| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3407| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 78))) [2019-05-15 10:37:39,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:39,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:39,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:39,265 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,266 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3408|]. (let ((.cse0 (select |v_#memory_int_3408| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3408| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:39,266 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:37:39,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:39,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:39,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:39,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:39,350 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:39,350 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3409|]. (let ((.cse0 (select |v_#memory_int_3409| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3409| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 80 .cse0))) [2019-05-15 10:37:39,351 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:37:39,414 INFO L273 TraceCheckUtils]: 0: Hoare triple {29012#true} havoc main_p1; {29012#true} is VALID [2019-05-15 10:37:39,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {29012#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {29012#true} is VALID [2019-05-15 10:37:39,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {29012#true} #memory_int := #memory_int[main_p1 := 0]; {29023#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:39,415 INFO L273 TraceCheckUtils]: 3: Hoare triple {29023#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29027#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:39,415 INFO L273 TraceCheckUtils]: 4: Hoare triple {29027#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29031#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:39,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {29031#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29035#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:39,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {29035#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29039#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:39,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {29039#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29043#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:39,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {29043#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29047#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:39,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {29047#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29051#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:39,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {29051#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29055#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:39,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {29055#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29059#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:39,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {29059#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29063#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:39,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {29063#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29067#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:39,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {29067#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29071#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:39,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {29071#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29075#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:39,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {29075#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29079#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:39,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {29079#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29083#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:39,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {29083#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29087#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:39,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {29087#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29091#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:39,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {29091#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29095#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:39,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {29095#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29099#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:39,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {29099#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29103#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:39,430 INFO L273 TraceCheckUtils]: 23: Hoare triple {29103#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29107#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:39,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {29107#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29111#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:39,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {29111#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29115#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:39,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {29115#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29119#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:39,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {29119#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29123#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:39,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {29123#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29127#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:39,435 INFO L273 TraceCheckUtils]: 29: Hoare triple {29127#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29131#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:39,436 INFO L273 TraceCheckUtils]: 30: Hoare triple {29131#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29135#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:39,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {29135#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29139#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:39,437 INFO L273 TraceCheckUtils]: 32: Hoare triple {29139#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29143#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:39,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {29143#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29147#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:39,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {29147#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29151#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:39,439 INFO L273 TraceCheckUtils]: 35: Hoare triple {29151#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29155#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:39,440 INFO L273 TraceCheckUtils]: 36: Hoare triple {29155#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29159#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:39,441 INFO L273 TraceCheckUtils]: 37: Hoare triple {29159#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29163#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:39,442 INFO L273 TraceCheckUtils]: 38: Hoare triple {29163#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29167#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:39,443 INFO L273 TraceCheckUtils]: 39: Hoare triple {29167#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29171#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:39,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {29171#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29175#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:39,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {29175#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29179#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:39,445 INFO L273 TraceCheckUtils]: 42: Hoare triple {29179#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29183#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:39,446 INFO L273 TraceCheckUtils]: 43: Hoare triple {29183#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29187#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:39,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {29187#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29191#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:39,447 INFO L273 TraceCheckUtils]: 45: Hoare triple {29191#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29195#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:39,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {29195#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29199#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:39,449 INFO L273 TraceCheckUtils]: 47: Hoare triple {29199#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29203#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:39,450 INFO L273 TraceCheckUtils]: 48: Hoare triple {29203#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29207#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:39,450 INFO L273 TraceCheckUtils]: 49: Hoare triple {29207#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29211#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:39,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {29211#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29215#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:39,452 INFO L273 TraceCheckUtils]: 51: Hoare triple {29215#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29219#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:39,453 INFO L273 TraceCheckUtils]: 52: Hoare triple {29219#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29223#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:39,454 INFO L273 TraceCheckUtils]: 53: Hoare triple {29223#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29227#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:39,454 INFO L273 TraceCheckUtils]: 54: Hoare triple {29227#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29231#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:39,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {29231#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29235#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:39,456 INFO L273 TraceCheckUtils]: 56: Hoare triple {29235#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29239#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:39,457 INFO L273 TraceCheckUtils]: 57: Hoare triple {29239#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29243#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:39,457 INFO L273 TraceCheckUtils]: 58: Hoare triple {29243#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29247#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:39,458 INFO L273 TraceCheckUtils]: 59: Hoare triple {29247#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29251#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:39,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {29251#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29255#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:39,460 INFO L273 TraceCheckUtils]: 61: Hoare triple {29255#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29259#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:39,460 INFO L273 TraceCheckUtils]: 62: Hoare triple {29259#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29263#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:39,461 INFO L273 TraceCheckUtils]: 63: Hoare triple {29263#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29267#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:39,462 INFO L273 TraceCheckUtils]: 64: Hoare triple {29267#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29271#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:39,463 INFO L273 TraceCheckUtils]: 65: Hoare triple {29271#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29275#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:39,463 INFO L273 TraceCheckUtils]: 66: Hoare triple {29275#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29279#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:39,464 INFO L273 TraceCheckUtils]: 67: Hoare triple {29279#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29283#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:39,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {29283#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29287#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:39,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {29287#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29291#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:39,466 INFO L273 TraceCheckUtils]: 70: Hoare triple {29291#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29295#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:39,467 INFO L273 TraceCheckUtils]: 71: Hoare triple {29295#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29299#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:39,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {29299#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29303#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:39,469 INFO L273 TraceCheckUtils]: 73: Hoare triple {29303#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29307#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:39,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {29307#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29311#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:39,470 INFO L273 TraceCheckUtils]: 75: Hoare triple {29311#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29315#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:39,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {29315#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29319#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:39,472 INFO L273 TraceCheckUtils]: 77: Hoare triple {29319#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29323#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:39,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {29323#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29327#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:39,473 INFO L273 TraceCheckUtils]: 79: Hoare triple {29327#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29331#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:39,474 INFO L273 TraceCheckUtils]: 80: Hoare triple {29331#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29335#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:39,475 INFO L273 TraceCheckUtils]: 81: Hoare triple {29335#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29339#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:39,475 INFO L273 TraceCheckUtils]: 82: Hoare triple {29339#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29343#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:37:39,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {29343#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29347#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:37:39,477 INFO L273 TraceCheckUtils]: 84: Hoare triple {29347#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} assume !(#memory_int[main_p1] >= 0); {29013#false} is VALID [2019-05-15 10:37:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:39,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:39,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-15 10:37:39,486 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-05-15 10:37:39,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:39,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states. [2019-05-15 10:37:39,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:39,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-05-15 10:37:39,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-15 10:37:39,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:37:39,556 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 84 states. [2019-05-15 10:37:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:53,312 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:37:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-15 10:37:53,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 85 [2019-05-15 10:37:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:37:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:37:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:37:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-05-15 10:37:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-05-15 10:37:53,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2019-05-15 10:37:53,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:53,384 INFO L225 Difference]: With dead ends: 87 [2019-05-15 10:37:53,384 INFO L226 Difference]: Without dead ends: 87 [2019-05-15 10:37:53,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-05-15 10:37:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-05-15 10:37:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-05-15 10:37:53,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:37:53,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 87 states. [2019-05-15 10:37:53,386 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:37:53,386 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:37:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:53,387 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:37:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:37:53,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:53,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:53,387 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states. [2019-05-15 10:37:53,387 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states. [2019-05-15 10:37:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:37:53,388 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-05-15 10:37:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:37:53,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:37:53,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:37:53,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:37:53,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:37:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:37:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-05-15 10:37:53,389 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-05-15 10:37:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:37:53,389 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-05-15 10:37:53,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-05-15 10:37:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-05-15 10:37:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-05-15 10:37:53,390 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:37:53,390 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-05-15 10:37:53,390 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:37:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:37:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash -133450552, now seen corresponding path program 82 times [2019-05-15 10:37:53,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:37:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:53,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-15 10:37:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:37:53,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:37:53,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:37:53,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:37:53,475 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,475 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3410|]. (= (store |v_#memory_int_3410| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:37:53,475 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:37:53,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3411|]. (let ((.cse0 (select |v_#memory_int_3411| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_3411| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:53,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:37:53,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,514 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3412|]. (let ((.cse0 (select |v_#memory_int_3412| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3412| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,514 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:37:53,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,535 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,535 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3413|]. (let ((.cse0 (select |v_#memory_int_3413| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= (store |v_#memory_int_3413| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,535 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:37:53,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,560 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,560 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3414|]. (let ((.cse0 (select |v_#memory_int_3414| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= (store |v_#memory_int_3414| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,560 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:37:53,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,581 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3415|]. (let ((.cse0 (select |v_#memory_int_3415| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3415| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 4))) [2019-05-15 10:37:53,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:37:53,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,598 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,606 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3416|]. (let ((.cse0 (select |v_#memory_int_3416| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3416| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:37:53,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:37:53,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3417|]. (let ((.cse0 (select |v_#memory_int_3417| ULTIMATE.start_main_p1))) (and (= 6 .cse0) (= |#memory_int| (store |v_#memory_int_3417| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:53,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:37:53,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,655 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3418|]. (let ((.cse0 (select |v_#memory_int_3418| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= (store |v_#memory_int_3418| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:37:53,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,682 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,682 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3419|]. (let ((.cse0 (select |v_#memory_int_3419| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3419| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:53,682 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:37:53,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,709 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,709 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3420|]. (let ((.cse0 (select |v_#memory_int_3420| ULTIMATE.start_main_p1))) (and (= 9 .cse0) (= (store |v_#memory_int_3420| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,710 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:37:53,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3421|]. (let ((.cse0 (select |v_#memory_int_3421| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3421| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:37:53,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:37:53,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3422|]. (let ((.cse0 (select |v_#memory_int_3422| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3422| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 11 .cse0))) [2019-05-15 10:37:53,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:37:53,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,800 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,800 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3423|]. (let ((.cse0 (select |v_#memory_int_3423| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_3423| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,800 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:37:53,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3424|]. (let ((.cse0 (select |v_#memory_int_3424| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= (store |v_#memory_int_3424| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:37:53,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3425|]. (let ((.cse0 (select |v_#memory_int_3425| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3425| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:37:53,859 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:37:53,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,889 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3426|]. (let ((.cse0 (select |v_#memory_int_3426| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_3426| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:53,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:37:53,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,922 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,923 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3427|]. (let ((.cse0 (select |v_#memory_int_3427| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3427| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 16 .cse0))) [2019-05-15 10:37:53,923 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:37:53,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,952 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3428|]. (let ((.cse0 (select |v_#memory_int_3428| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3428| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:37:53,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:37:53,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:53,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:53,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:53,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:53,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:53,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3429|]. (let ((.cse0 (select |v_#memory_int_3429| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3429| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 18 .cse0))) [2019-05-15 10:37:53,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:37:54,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3430|]. (let ((.cse0 (select |v_#memory_int_3430| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3430| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 19 .cse0))) [2019-05-15 10:37:54,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:37:54,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,059 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3431|]. (let ((.cse0 (select |v_#memory_int_3431| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_3431| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,059 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:37:54,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3432|]. (let ((.cse0 (select |v_#memory_int_3432| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= |#memory_int| (store |v_#memory_int_3432| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:54,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:37:54,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,132 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,132 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3433|]. (let ((.cse0 (select |v_#memory_int_3433| ULTIMATE.start_main_p1))) (and (= 22 .cse0) (= (store |v_#memory_int_3433| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,132 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:37:54,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,170 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,170 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3434|]. (let ((.cse0 (select |v_#memory_int_3434| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3434| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 23 .cse0))) [2019-05-15 10:37:54,170 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:37:54,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3435|]. (let ((.cse0 (select |v_#memory_int_3435| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3435| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:37:54,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,249 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,249 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3436|]. (let ((.cse0 (select |v_#memory_int_3436| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= (store |v_#memory_int_3436| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,249 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:37:54,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,279 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,287 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3437|]. (let ((.cse0 (select |v_#memory_int_3437| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3437| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:37:54,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:37:54,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3438|]. (let ((.cse0 (select |v_#memory_int_3438| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3438| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:37:54,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:37:54,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,371 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,371 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3439|]. (let ((.cse0 (select |v_#memory_int_3439| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3439| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:37:54,371 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:37:54,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3440|]. (let ((.cse0 (select |v_#memory_int_3440| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3440| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:37:54,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:37:54,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3441|]. (let ((.cse0 (select |v_#memory_int_3441| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_3441| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:37:54,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,502 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,502 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3442|]. (let ((.cse0 (select |v_#memory_int_3442| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3442| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 31))) [2019-05-15 10:37:54,502 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:37:54,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,554 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3443|]. (let ((.cse0 (select |v_#memory_int_3443| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3443| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,554 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:37:54,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,598 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,598 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3444|]. (let ((.cse0 (select |v_#memory_int_3444| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_3444| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,599 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:37:54,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,645 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3445|]. (let ((.cse0 (select |v_#memory_int_3445| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3445| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:37:54,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:37:54,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,692 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,692 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3446|]. (let ((.cse0 (select |v_#memory_int_3446| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_3446| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,692 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:37:54,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,740 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3447|]. (let ((.cse0 (select |v_#memory_int_3447| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3447| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:37:54,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3448|]. (let ((.cse0 (select |v_#memory_int_3448| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= |#memory_int| (store |v_#memory_int_3448| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:54,786 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:37:54,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3449|]. (let ((.cse0 (select |v_#memory_int_3449| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_3449| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:37:54,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,888 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3450|]. (let ((.cse0 (select |v_#memory_int_3450| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3450| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,888 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:37:54,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,939 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,939 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3451|]. (let ((.cse0 (select |v_#memory_int_3451| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3451| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:37:54,939 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:37:54,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:54,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:54,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:54,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:54,991 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:54,991 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3452|]. (let ((.cse0 (select |v_#memory_int_3452| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3452| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:54,991 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:37:55,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3453|]. (let ((.cse0 (select |v_#memory_int_3453| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3453| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:37:55,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:37:55,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3454|]. (let ((.cse0 (select |v_#memory_int_3454| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3454| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:37:55,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:37:55,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3455|]. (let ((.cse0 (select |v_#memory_int_3455| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3455| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 44))) [2019-05-15 10:37:55,166 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:37:55,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3456|]. (let ((.cse0 (select |v_#memory_int_3456| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3456| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:37:55,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:37:55,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,282 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,282 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3457|]. (let ((.cse0 (select |v_#memory_int_3457| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_3457| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:55,282 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:37:55,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3458|]. (let ((.cse0 (select |v_#memory_int_3458| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= (store |v_#memory_int_3458| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:37:55,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,404 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3459|]. (let ((.cse0 (select |v_#memory_int_3459| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3459| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 48 .cse0))) [2019-05-15 10:37:55,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:37:55,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,452 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,460 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,460 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3460|]. (let ((.cse0 (select |v_#memory_int_3460| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3460| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,460 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:37:55,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,519 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,519 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3461|]. (let ((.cse0 (select |v_#memory_int_3461| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= |#memory_int| (store |v_#memory_int_3461| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:55,519 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:37:55,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,582 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3462|]. (let ((.cse0 (select |v_#memory_int_3462| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= |#memory_int| (store |v_#memory_int_3462| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:55,582 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:37:55,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,641 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,641 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3463|]. (let ((.cse0 (select |v_#memory_int_3463| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3463| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:37:55,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3464|]. (let ((.cse0 (select |v_#memory_int_3464| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3464| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:37:55,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,760 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,760 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3465|]. (let ((.cse0 (select |v_#memory_int_3465| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_3465| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,760 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:37:55,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,820 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3466|]. (let ((.cse0 (select |v_#memory_int_3466| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3466| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:37:55,820 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:37:55,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,883 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3467|]. (let ((.cse0 (select |v_#memory_int_3467| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3467| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:55,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:37:55,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:55,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:55,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:55,943 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:55,943 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3468|]. (let ((.cse0 (select |v_#memory_int_3468| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3468| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 57))) [2019-05-15 10:37:55,943 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:37:55,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:55,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,007 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3469|]. (let ((.cse0 (select |v_#memory_int_3469| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3469| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:37:56,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,078 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,078 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3470|]. (let ((.cse0 (select |v_#memory_int_3470| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3470| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:37:56,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,143 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,143 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3471|]. (let ((.cse0 (select |v_#memory_int_3471| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3471| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,143 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:37:56,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,210 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3472|]. (let ((.cse0 (select |v_#memory_int_3472| ULTIMATE.start_main_p1))) (and (= 61 .cse0) (= (store |v_#memory_int_3472| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:37:56,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3473|]. (let ((.cse0 (select |v_#memory_int_3473| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3473| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:37:56,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:37:56,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,334 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3474|]. (let ((.cse0 (select |v_#memory_int_3474| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3474| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:37:56,343 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:37:56,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,411 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,411 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3475|]. (let ((.cse0 (select |v_#memory_int_3475| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= |#memory_int| (store |v_#memory_int_3475| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:56,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:37:56,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3476|]. (let ((.cse0 (select |v_#memory_int_3476| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_3476| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:37:56,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3477|]. (let ((.cse0 (select |v_#memory_int_3477| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3477| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,553 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:37:56,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,623 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,623 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3478|]. (let ((.cse0 (select |v_#memory_int_3478| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3478| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:37:56,623 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:37:56,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3479|]. (let ((.cse0 (select |v_#memory_int_3479| ULTIMATE.start_main_p1))) (and (= .cse0 68) (= |#memory_int| (store |v_#memory_int_3479| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:37:56,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:37:56,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3480|]. (let ((.cse0 (select |v_#memory_int_3480| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3480| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:37:56,765 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:37:56,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,838 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,838 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3481|]. (let ((.cse0 (select |v_#memory_int_3481| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3481| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:56,838 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:37:56,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3482|]. (let ((.cse0 (select |v_#memory_int_3482| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3482| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:37:56,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:37:56,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:56,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:56,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:56,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:56,987 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:56,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3483|]. (let ((.cse0 (select |v_#memory_int_3483| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3483| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 72))) [2019-05-15 10:37:56,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:37:57,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3484|]. (let ((.cse0 (select |v_#memory_int_3484| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3484| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 73))) [2019-05-15 10:37:57,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:37:57,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,141 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3485|]. (let ((.cse0 (select |v_#memory_int_3485| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3485| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:37:57,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:37:57,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3486|]. (let ((.cse0 (select |v_#memory_int_3486| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3486| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:37:57,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:37:57,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3487|]. (let ((.cse0 (select |v_#memory_int_3487| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3487| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 76))) [2019-05-15 10:37:57,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:37:57,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,373 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,373 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3488|]. (let ((.cse0 (select |v_#memory_int_3488| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3488| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 77))) [2019-05-15 10:37:57,373 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:37:57,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3489|]. (let ((.cse0 (select |v_#memory_int_3489| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3489| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 78))) [2019-05-15 10:37:57,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:37:57,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3490|]. (let ((.cse0 (select |v_#memory_int_3490| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3490| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:57,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:37:57,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3491|]. (let ((.cse0 (select |v_#memory_int_3491| ULTIMATE.start_main_p1))) (and (= 80 .cse0) (= (store |v_#memory_int_3491| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:57,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:37:57,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:37:57,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:37:57,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:37:57,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:37:57,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:37:57,698 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3492|]. (let ((.cse0 (select |v_#memory_int_3492| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_3492| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:37:57,698 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:37:57,765 INFO L273 TraceCheckUtils]: 0: Hoare triple {29698#true} havoc main_p1; {29698#true} is VALID [2019-05-15 10:37:57,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {29698#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {29698#true} is VALID [2019-05-15 10:37:57,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {29698#true} #memory_int := #memory_int[main_p1 := 0]; {29709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:37:57,767 INFO L273 TraceCheckUtils]: 3: Hoare triple {29709#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:37:57,767 INFO L273 TraceCheckUtils]: 4: Hoare triple {29713#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:37:57,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {29717#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:37:57,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {29721#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:37:57,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {29725#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:37:57,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {29729#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:37:57,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {29733#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:37:57,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {29737#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:37:57,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {29741#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:37:57,773 INFO L273 TraceCheckUtils]: 12: Hoare triple {29745#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:37:57,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {29749#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:37:57,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {29753#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:37:57,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {29757#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:37:57,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {29761#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:37:57,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {29765#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:37:57,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {29769#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:37:57,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {29773#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:37:57,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {29777#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:37:57,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {29781#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:37:57,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {29785#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:37:57,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {29789#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:37:57,782 INFO L273 TraceCheckUtils]: 24: Hoare triple {29793#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:37:57,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {29797#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29801#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:37:57,784 INFO L273 TraceCheckUtils]: 26: Hoare triple {29801#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29805#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:37:57,784 INFO L273 TraceCheckUtils]: 27: Hoare triple {29805#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29809#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:37:57,785 INFO L273 TraceCheckUtils]: 28: Hoare triple {29809#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29813#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:37:57,786 INFO L273 TraceCheckUtils]: 29: Hoare triple {29813#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29817#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:37:57,787 INFO L273 TraceCheckUtils]: 30: Hoare triple {29817#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29821#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:37:57,787 INFO L273 TraceCheckUtils]: 31: Hoare triple {29821#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29825#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:37:57,788 INFO L273 TraceCheckUtils]: 32: Hoare triple {29825#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29829#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:37:57,789 INFO L273 TraceCheckUtils]: 33: Hoare triple {29829#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29833#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:37:57,790 INFO L273 TraceCheckUtils]: 34: Hoare triple {29833#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29837#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:37:57,790 INFO L273 TraceCheckUtils]: 35: Hoare triple {29837#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29841#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:37:57,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {29841#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29845#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:37:57,792 INFO L273 TraceCheckUtils]: 37: Hoare triple {29845#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29849#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:37:57,793 INFO L273 TraceCheckUtils]: 38: Hoare triple {29849#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29853#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:37:57,793 INFO L273 TraceCheckUtils]: 39: Hoare triple {29853#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29857#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:37:57,794 INFO L273 TraceCheckUtils]: 40: Hoare triple {29857#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29861#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:37:57,795 INFO L273 TraceCheckUtils]: 41: Hoare triple {29861#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29865#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:37:57,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {29865#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29869#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:37:57,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {29869#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29873#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:37:57,797 INFO L273 TraceCheckUtils]: 44: Hoare triple {29873#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29877#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:37:57,798 INFO L273 TraceCheckUtils]: 45: Hoare triple {29877#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29881#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:37:57,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {29881#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29885#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:37:57,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {29885#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29889#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:37:57,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {29889#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29893#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:37:57,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {29893#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29897#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:37:57,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {29897#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29901#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:37:57,802 INFO L273 TraceCheckUtils]: 51: Hoare triple {29901#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29905#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:37:57,803 INFO L273 TraceCheckUtils]: 52: Hoare triple {29905#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29909#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:37:57,804 INFO L273 TraceCheckUtils]: 53: Hoare triple {29909#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29913#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:37:57,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {29913#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29917#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:37:57,805 INFO L273 TraceCheckUtils]: 55: Hoare triple {29917#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29921#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:37:57,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {29921#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29925#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:37:57,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {29925#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29929#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:37:57,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {29929#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29933#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:37:57,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {29933#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29937#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:37:57,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {29937#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29941#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:37:57,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {29941#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29945#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:37:57,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {29945#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29949#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:37:57,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {29949#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29953#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:37:57,812 INFO L273 TraceCheckUtils]: 64: Hoare triple {29953#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29957#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:37:57,813 INFO L273 TraceCheckUtils]: 65: Hoare triple {29957#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29961#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:37:57,813 INFO L273 TraceCheckUtils]: 66: Hoare triple {29961#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29965#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:37:57,814 INFO L273 TraceCheckUtils]: 67: Hoare triple {29965#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29969#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:37:57,815 INFO L273 TraceCheckUtils]: 68: Hoare triple {29969#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29973#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:37:57,816 INFO L273 TraceCheckUtils]: 69: Hoare triple {29973#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29977#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:37:57,816 INFO L273 TraceCheckUtils]: 70: Hoare triple {29977#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29981#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:37:57,817 INFO L273 TraceCheckUtils]: 71: Hoare triple {29981#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29985#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:37:57,818 INFO L273 TraceCheckUtils]: 72: Hoare triple {29985#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29989#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:37:57,819 INFO L273 TraceCheckUtils]: 73: Hoare triple {29989#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29993#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:37:57,819 INFO L273 TraceCheckUtils]: 74: Hoare triple {29993#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {29997#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:37:57,820 INFO L273 TraceCheckUtils]: 75: Hoare triple {29997#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30001#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:37:57,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {30001#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30005#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:37:57,822 INFO L273 TraceCheckUtils]: 77: Hoare triple {30005#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30009#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:37:57,822 INFO L273 TraceCheckUtils]: 78: Hoare triple {30009#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30013#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:37:57,823 INFO L273 TraceCheckUtils]: 79: Hoare triple {30013#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30017#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:37:57,824 INFO L273 TraceCheckUtils]: 80: Hoare triple {30017#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30021#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:37:57,825 INFO L273 TraceCheckUtils]: 81: Hoare triple {30021#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30025#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:37:57,825 INFO L273 TraceCheckUtils]: 82: Hoare triple {30025#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30029#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:37:57,826 INFO L273 TraceCheckUtils]: 83: Hoare triple {30029#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30033#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:37:57,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {30033#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30037#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:37:57,827 INFO L273 TraceCheckUtils]: 85: Hoare triple {30037#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} assume !(#memory_int[main_p1] >= 0); {29699#false} is VALID [2019-05-15 10:37:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:37:57,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:37:57,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-15 10:37:57,837 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-05-15 10:37:57,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:37:57,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states. [2019-05-15 10:37:57,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:37:57,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-05-15 10:37:57,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-15 10:37:57,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-05-15 10:37:57,905 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 85 states. [2019-05-15 10:38:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:12,219 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:12,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-15 10:38:12,220 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 86 [2019-05-15 10:38:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:38:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-05-15 10:38:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-05-15 10:38:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-05-15 10:38:12,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 85 states and 89 transitions. [2019-05-15 10:38:12,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:12,295 INFO L225 Difference]: With dead ends: 88 [2019-05-15 10:38:12,295 INFO L226 Difference]: Without dead ends: 88 [2019-05-15 10:38:12,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-05-15 10:38:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-05-15 10:38:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-05-15 10:38:12,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:12,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:12,297 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:12,297 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:12,298 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:12,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:12,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:12,299 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:12,299 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2019-05-15 10:38:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:12,299 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-05-15 10:38:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:12,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:12,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:12,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:12,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:38:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-05-15 10:38:12,301 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-05-15 10:38:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:12,301 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-05-15 10:38:12,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-05-15 10:38:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-05-15 10:38:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-05-15 10:38:12,301 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:12,301 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-05-15 10:38:12,302 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 158000130, now seen corresponding path program 83 times [2019-05-15 10:38:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:12,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-15 10:38:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:12,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:12,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:38:12,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:12,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3493|]. (= |#memory_int| (store |v_#memory_int_3493| ULTIMATE.start_main_p1 0)) [2019-05-15 10:38:12,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:12,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,410 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,410 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3494|]. (let ((.cse0 (select |v_#memory_int_3494| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_3494| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:12,411 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:12,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3495|]. (let ((.cse0 (select |v_#memory_int_3495| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3495| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:38:12,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:12,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3496|]. (let ((.cse0 (select |v_#memory_int_3496| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3496| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 2 .cse0))) [2019-05-15 10:38:12,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:12,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3497|]. (let ((.cse0 (select |v_#memory_int_3497| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3497| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 3 .cse0))) [2019-05-15 10:38:12,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:12,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3498|]. (let ((.cse0 (select |v_#memory_int_3498| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= |#memory_int| (store |v_#memory_int_3498| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:12,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:12,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3499|]. (let ((.cse0 (select |v_#memory_int_3499| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3499| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:38:12,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:12,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,552 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,552 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3500|]. (let ((.cse0 (select |v_#memory_int_3500| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3500| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:12,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3501|]. (let ((.cse0 (select |v_#memory_int_3501| ULTIMATE.start_main_p1))) (and (= 7 .cse0) (= |#memory_int| (store |v_#memory_int_3501| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:12,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:12,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,605 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,605 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3502|]. (let ((.cse0 (select |v_#memory_int_3502| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3502| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:38:12,606 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:12,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,636 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,636 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3503|]. (let ((.cse0 (select |v_#memory_int_3503| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_3503| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,636 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:12,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,663 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3504|]. (let ((.cse0 (select |v_#memory_int_3504| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3504| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:38:12,663 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:12,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3505|]. (let ((.cse0 (select |v_#memory_int_3505| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3505| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:38:12,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:12,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3506|]. (let ((.cse0 (select |v_#memory_int_3506| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3506| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:38:12,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:12,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,751 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,751 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3507|]. (let ((.cse0 (select |v_#memory_int_3507| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3507| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:38:12,751 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:12,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,783 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,783 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3508|]. (let ((.cse0 (select |v_#memory_int_3508| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_3508| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,783 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:12,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,807 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,813 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3509|]. (let ((.cse0 (select |v_#memory_int_3509| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3509| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:38:12,813 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:12,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,846 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3510|]. (let ((.cse0 (select |v_#memory_int_3510| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3510| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:12,846 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:12,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,878 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,879 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3511|]. (let ((.cse0 (select |v_#memory_int_3511| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3511| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 17 .cse0))) [2019-05-15 10:38:12,879 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:12,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,906 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,914 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3512|]. (let ((.cse0 (select |v_#memory_int_3512| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3512| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:38:12,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:12,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,949 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3513|]. (let ((.cse0 (select |v_#memory_int_3513| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3513| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:12,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:12,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:12,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:12,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:12,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:12,984 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:12,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3514|]. (let ((.cse0 (select |v_#memory_int_3514| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3514| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:38:12,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:13,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,023 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3515|]. (let ((.cse0 (select |v_#memory_int_3515| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3515| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 21 .cse0))) [2019-05-15 10:38:13,023 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:13,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,059 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3516|]. (let ((.cse0 (select |v_#memory_int_3516| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= |#memory_int| (store |v_#memory_int_3516| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:13,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:13,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,099 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,099 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3517|]. (let ((.cse0 (select |v_#memory_int_3517| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3517| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,099 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:13,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3518|]. (let ((.cse0 (select |v_#memory_int_3518| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3518| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:13,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3519|]. (let ((.cse0 (select |v_#memory_int_3519| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3519| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:13,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,220 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,220 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3520|]. (let ((.cse0 (select |v_#memory_int_3520| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_3520| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:13,220 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:13,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,261 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,262 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3521|]. (let ((.cse0 (select |v_#memory_int_3521| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3521| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 27 .cse0))) [2019-05-15 10:38:13,262 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:13,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,304 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3522|]. (let ((.cse0 (select |v_#memory_int_3522| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3522| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:13,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,353 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3523|]. (let ((.cse0 (select |v_#memory_int_3523| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3523| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:13,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,395 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,395 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3524|]. (let ((.cse0 (select |v_#memory_int_3524| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3524| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:38:13,395 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:13,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,445 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,445 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3525|]. (let ((.cse0 (select |v_#memory_int_3525| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3525| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,445 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:13,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,491 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,491 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3526|]. (let ((.cse0 (select |v_#memory_int_3526| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= (store |v_#memory_int_3526| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,491 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:13,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3527|]. (let ((.cse0 (select |v_#memory_int_3527| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3527| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:38:13,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:13,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,582 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,583 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3528|]. (let ((.cse0 (select |v_#memory_int_3528| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3528| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:38:13,583 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:13,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,630 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,630 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3529|]. (let ((.cse0 (select |v_#memory_int_3529| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= (store |v_#memory_int_3529| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,630 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:13,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,680 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3530|]. (let ((.cse0 (select |v_#memory_int_3530| ULTIMATE.start_main_p1))) (and (= .cse0 36) (= |#memory_int| (store |v_#memory_int_3530| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:13,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:13,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3531|]. (let ((.cse0 (select |v_#memory_int_3531| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3531| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:38:13,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38:13,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3532|]. (let ((.cse0 (select |v_#memory_int_3532| ULTIMATE.start_main_p1))) (and (= 38 .cse0) (= (store |v_#memory_int_3532| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:13,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,831 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,831 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3533|]. (let ((.cse0 (select |v_#memory_int_3533| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3533| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:38:13,831 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:13,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3534|]. (let ((.cse0 (select |v_#memory_int_3534| ULTIMATE.start_main_p1))) (and (= 40 .cse0) (= (store |v_#memory_int_3534| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:13,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:13,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,935 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3535|]. (let ((.cse0 (select |v_#memory_int_3535| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= |#memory_int| (store |v_#memory_int_3535| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:13,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:13,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:13,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:13,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:13,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:13,988 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:13,988 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3536|]. (let ((.cse0 (select |v_#memory_int_3536| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3536| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:13,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:14,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3537|]. (let ((.cse0 (select |v_#memory_int_3537| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3537| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:14,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:14,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3538|]. (let ((.cse0 (select |v_#memory_int_3538| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3538| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:38:14,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:14,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,153 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3539|]. (let ((.cse0 (select |v_#memory_int_3539| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_3539| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:14,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:14,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,212 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,213 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3540|]. (let ((.cse0 (select |v_#memory_int_3540| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3540| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:38:14,213 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:14,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,269 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,270 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3541|]. (let ((.cse0 (select |v_#memory_int_3541| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3541| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 47 .cse0))) [2019-05-15 10:38:14,270 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:14,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3542|]. (let ((.cse0 (select |v_#memory_int_3542| ULTIMATE.start_main_p1))) (and (= 48 .cse0) (= (store |v_#memory_int_3542| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:14,328 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:14,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3543|]. (let ((.cse0 (select |v_#memory_int_3543| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3543| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:38:14,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:14,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,450 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,450 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3544|]. (let ((.cse0 (select |v_#memory_int_3544| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3544| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:38:14,450 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:14,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,512 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3545|]. (let ((.cse0 (select |v_#memory_int_3545| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= |#memory_int| (store |v_#memory_int_3545| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:14,512 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:14,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,571 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3546|]. (let ((.cse0 (select |v_#memory_int_3546| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3546| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:14,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:14,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,632 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,632 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3547|]. (let ((.cse0 (select |v_#memory_int_3547| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3547| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:14,632 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:14,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,694 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3548|]. (let ((.cse0 (select |v_#memory_int_3548| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3548| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:38:14,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:14,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3549|]. (let ((.cse0 (select |v_#memory_int_3549| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= |#memory_int| (store |v_#memory_int_3549| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:14,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:14,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,824 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,824 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3550|]. (let ((.cse0 (select |v_#memory_int_3550| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3550| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 56))) [2019-05-15 10:38:14,824 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:14,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,897 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3551|]. (let ((.cse0 (select |v_#memory_int_3551| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3551| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:38:14,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:14,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:14,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:14,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:14,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:14,961 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:14,961 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3552|]. (let ((.cse0 (select |v_#memory_int_3552| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3552| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:38:14,961 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:15,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,029 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,030 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3553|]. (let ((.cse0 (select |v_#memory_int_3553| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3553| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:15,030 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:15,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,093 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,093 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3554|]. (let ((.cse0 (select |v_#memory_int_3554| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3554| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:38:15,093 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:15,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3555|]. (let ((.cse0 (select |v_#memory_int_3555| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3555| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:15,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:15,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3556|]. (let ((.cse0 (select |v_#memory_int_3556| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3556| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:38:15,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:15,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,294 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3557|]. (let ((.cse0 (select |v_#memory_int_3557| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3557| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 63))) [2019-05-15 10:38:15,294 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:15,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3558|]. (let ((.cse0 (select |v_#memory_int_3558| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3558| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:38:15,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:15,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3559|]. (let ((.cse0 (select |v_#memory_int_3559| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3559| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:38:15,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:15,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,506 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,506 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3560|]. (let ((.cse0 (select |v_#memory_int_3560| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_3560| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:15,507 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:15,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3561|]. (let ((.cse0 (select |v_#memory_int_3561| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3561| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:38:15,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:15,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,655 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3562|]. (let ((.cse0 (select |v_#memory_int_3562| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3562| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:15,655 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:15,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,728 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3563|]. (let ((.cse0 (select |v_#memory_int_3563| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3563| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:38:15,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:15,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,805 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3564|]. (let ((.cse0 (select |v_#memory_int_3564| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_3564| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:15,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:15,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3565|]. (let ((.cse0 (select |v_#memory_int_3565| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3565| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:38:15,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:15,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:15,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:15,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:15,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:15,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:15,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3566|]. (let ((.cse0 (select |v_#memory_int_3566| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3566| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:38:15,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:16,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,039 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,040 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3567|]. (let ((.cse0 (select |v_#memory_int_3567| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_3567| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,040 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38:16,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3568|]. (let ((.cse0 (select |v_#memory_int_3568| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= (store |v_#memory_int_3568| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:16,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,190 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,190 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3569|]. (let ((.cse0 (select |v_#memory_int_3569| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3569| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:38:16,190 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:16,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3570|]. (let ((.cse0 (select |v_#memory_int_3570| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3570| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38:16,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,352 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,353 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3571|]. (let ((.cse0 (select |v_#memory_int_3571| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3571| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:38:16,353 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:16,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,430 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,430 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3572|]. (let ((.cse0 (select |v_#memory_int_3572| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3572| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,430 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:16,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3573|]. (let ((.cse0 (select |v_#memory_int_3573| ULTIMATE.start_main_p1))) (and (= 79 .cse0) (= |#memory_int| (store |v_#memory_int_3573| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:16,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:16,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,591 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3574|]. (let ((.cse0 (select |v_#memory_int_3574| ULTIMATE.start_main_p1))) (and (= 80 .cse0) (= (store |v_#memory_int_3574| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:16,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,674 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,674 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3575|]. (let ((.cse0 (select |v_#memory_int_3575| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3575| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 81 .cse0))) [2019-05-15 10:38:16,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:16,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:16,744 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:16,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:16,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:16,755 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:16,755 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3576|]. (let ((.cse0 (select |v_#memory_int_3576| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= (store |v_#memory_int_3576| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:16,755 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:38:16,822 INFO L273 TraceCheckUtils]: 0: Hoare triple {30392#true} havoc main_p1; {30392#true} is VALID [2019-05-15 10:38:16,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {30392#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {30392#true} is VALID [2019-05-15 10:38:16,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {30392#true} #memory_int := #memory_int[main_p1 := 0]; {30403#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:16,824 INFO L273 TraceCheckUtils]: 3: Hoare triple {30403#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30407#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:16,825 INFO L273 TraceCheckUtils]: 4: Hoare triple {30407#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30411#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:16,825 INFO L273 TraceCheckUtils]: 5: Hoare triple {30411#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30415#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:16,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {30415#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30419#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:16,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {30419#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30423#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:16,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {30423#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30427#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:16,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {30427#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30431#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:16,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {30431#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30435#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:16,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {30435#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30439#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:16,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {30439#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30443#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:16,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {30443#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30447#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:16,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {30447#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30451#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:16,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {30451#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30455#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:16,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {30455#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30459#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:16,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {30459#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30463#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:16,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {30463#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30467#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:16,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {30467#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30471#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:16,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {30471#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30475#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:16,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {30475#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30479#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:16,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {30479#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30483#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:16,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {30483#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30487#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:16,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {30487#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30491#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:16,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {30491#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30495#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:16,840 INFO L273 TraceCheckUtils]: 26: Hoare triple {30495#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30499#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:16,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {30499#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30503#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:16,841 INFO L273 TraceCheckUtils]: 28: Hoare triple {30503#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30507#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:16,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {30507#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30511#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:16,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {30511#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30515#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:16,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {30515#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30519#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:16,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {30519#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30523#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:16,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {30523#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30527#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:16,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {30527#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30531#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:16,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {30531#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30535#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:16,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {30535#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30539#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:16,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {30539#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30543#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:16,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {30543#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30547#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:16,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {30547#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30551#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:16,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {30551#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30555#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:16,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {30555#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30559#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:16,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {30559#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30563#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:16,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {30563#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30567#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:16,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {30567#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30571#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:16,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {30571#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30575#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:16,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {30575#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30579#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:16,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {30579#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30583#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:16,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {30583#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30587#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:16,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {30587#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30591#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:16,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {30591#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30595#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:16,859 INFO L273 TraceCheckUtils]: 51: Hoare triple {30595#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30599#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:16,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {30599#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30603#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:16,860 INFO L273 TraceCheckUtils]: 53: Hoare triple {30603#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30607#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:16,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {30607#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30611#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:16,861 INFO L273 TraceCheckUtils]: 55: Hoare triple {30611#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30615#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:16,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {30615#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30619#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:16,863 INFO L273 TraceCheckUtils]: 57: Hoare triple {30619#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30623#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:16,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {30623#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30627#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:16,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {30627#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30631#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:16,865 INFO L273 TraceCheckUtils]: 60: Hoare triple {30631#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30635#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:16,866 INFO L273 TraceCheckUtils]: 61: Hoare triple {30635#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30639#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:16,867 INFO L273 TraceCheckUtils]: 62: Hoare triple {30639#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30643#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:16,867 INFO L273 TraceCheckUtils]: 63: Hoare triple {30643#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30647#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:16,868 INFO L273 TraceCheckUtils]: 64: Hoare triple {30647#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30651#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:16,869 INFO L273 TraceCheckUtils]: 65: Hoare triple {30651#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30655#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:16,870 INFO L273 TraceCheckUtils]: 66: Hoare triple {30655#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30659#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:16,870 INFO L273 TraceCheckUtils]: 67: Hoare triple {30659#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30663#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:16,871 INFO L273 TraceCheckUtils]: 68: Hoare triple {30663#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30667#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:16,872 INFO L273 TraceCheckUtils]: 69: Hoare triple {30667#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30671#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:16,873 INFO L273 TraceCheckUtils]: 70: Hoare triple {30671#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30675#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:16,873 INFO L273 TraceCheckUtils]: 71: Hoare triple {30675#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30679#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:16,874 INFO L273 TraceCheckUtils]: 72: Hoare triple {30679#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30683#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:16,875 INFO L273 TraceCheckUtils]: 73: Hoare triple {30683#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30687#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:16,876 INFO L273 TraceCheckUtils]: 74: Hoare triple {30687#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30691#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:16,876 INFO L273 TraceCheckUtils]: 75: Hoare triple {30691#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30695#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:16,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {30695#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30699#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:16,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {30699#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30703#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:16,879 INFO L273 TraceCheckUtils]: 78: Hoare triple {30703#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30707#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:16,879 INFO L273 TraceCheckUtils]: 79: Hoare triple {30707#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30711#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:16,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {30711#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30715#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:16,881 INFO L273 TraceCheckUtils]: 81: Hoare triple {30715#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30719#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:16,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {30719#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30723#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:16,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {30723#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30727#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:16,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {30727#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30731#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:16,884 INFO L273 TraceCheckUtils]: 85: Hoare triple {30731#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {30735#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:38:16,884 INFO L273 TraceCheckUtils]: 86: Hoare triple {30735#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} assume !(#memory_int[main_p1] >= 0); {30393#false} is VALID [2019-05-15 10:38:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-15 10:38:16,895 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-05-15 10:38:16,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:16,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states. [2019-05-15 10:38:17,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:17,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-05-15 10:38:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-15 10:38:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:38:17,034 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 86 states. [2019-05-15 10:38:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:31,404 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-15 10:38:31,404 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 87 [2019-05-15 10:38:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:38:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:38:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-05-15 10:38:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2019-05-15 10:38:31,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2019-05-15 10:38:31,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:31,478 INFO L225 Difference]: With dead ends: 89 [2019-05-15 10:38:31,478 INFO L226 Difference]: Without dead ends: 89 [2019-05-15 10:38:31,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2019-05-15 10:38:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-05-15 10:38:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-05-15 10:38:31,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:31,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:31,480 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:31,480 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:31,481 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:31,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:31,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:31,482 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:31,482 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 89 states. [2019-05-15 10:38:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:31,483 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-05-15 10:38:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:31,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:31,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:31,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:31,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:38:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-05-15 10:38:31,484 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-05-15 10:38:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:31,484 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-05-15 10:38:31,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-05-15 10:38:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-05-15 10:38:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-05-15 10:38:31,484 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:31,485 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-05-15 10:38:31,485 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 603036680, now seen corresponding path program 84 times [2019-05-15 10:38:31,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:31,528 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-15 10:38:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:31,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:31,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:38:31,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:31,718 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,718 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3577|]. (= (store |v_#memory_int_3577| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:38:31,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:31,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,738 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,738 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3578|]. (let ((.cse0 (select |v_#memory_int_3578| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= (store |v_#memory_int_3578| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,739 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:31,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,759 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,759 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3579|]. (let ((.cse0 (select |v_#memory_int_3579| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_3579| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,759 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:31,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,781 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3580|]. (let ((.cse0 (select |v_#memory_int_3580| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3580| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:38:31,781 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:31,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,803 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3581|]. (let ((.cse0 (select |v_#memory_int_3581| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= (store |v_#memory_int_3581| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,803 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:31,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,826 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,827 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3582|]. (let ((.cse0 (select |v_#memory_int_3582| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_3582| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,827 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:31,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,849 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,850 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3583|]. (let ((.cse0 (select |v_#memory_int_3583| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3583| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 5 .cse0))) [2019-05-15 10:38:31,850 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:31,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3584|]. (let ((.cse0 (select |v_#memory_int_3584| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3584| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:31,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:31,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,898 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,898 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3585|]. (let ((.cse0 (select |v_#memory_int_3585| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3585| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:38:31,898 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:31,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,925 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3586|]. (let ((.cse0 (select |v_#memory_int_3586| ULTIMATE.start_main_p1))) (and (= 8 .cse0) (= |#memory_int| (store |v_#memory_int_3586| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:31,926 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:31,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,954 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,954 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3587|]. (let ((.cse0 (select |v_#memory_int_3587| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3587| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 9 .cse0))) [2019-05-15 10:38:31,954 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:31,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:31,974 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:31,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:31,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:31,983 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:31,983 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3588|]. (let ((.cse0 (select |v_#memory_int_3588| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3588| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:38:31,983 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:32,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3589|]. (let ((.cse0 (select |v_#memory_int_3589| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3589| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:38:32,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:32,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,042 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3590|]. (let ((.cse0 (select |v_#memory_int_3590| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3590| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:38:32,042 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:32,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,071 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,072 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3591|]. (let ((.cse0 (select |v_#memory_int_3591| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3591| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 13))) [2019-05-15 10:38:32,072 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:32,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3592|]. (let ((.cse0 (select |v_#memory_int_3592| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3592| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:38:32,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:32,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3593|]. (let ((.cse0 (select |v_#memory_int_3593| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3593| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:38:32,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:32,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,161 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,161 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3594|]. (let ((.cse0 (select |v_#memory_int_3594| ULTIMATE.start_main_p1))) (and (= 16 .cse0) (= |#memory_int| (store |v_#memory_int_3594| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:32,161 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:32,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,192 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3595|]. (let ((.cse0 (select |v_#memory_int_3595| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3595| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:38:32,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:32,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,224 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,225 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3596|]. (let ((.cse0 (select |v_#memory_int_3596| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3596| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:32,225 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:32,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,258 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,259 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3597|]. (let ((.cse0 (select |v_#memory_int_3597| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3597| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:32,259 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:32,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,292 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,292 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3598|]. (let ((.cse0 (select |v_#memory_int_3598| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_3598| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:32,292 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:32,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,326 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,326 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3599|]. (let ((.cse0 (select |v_#memory_int_3599| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3599| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:38:32,326 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:32,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,362 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,362 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3600|]. (let ((.cse0 (select |v_#memory_int_3600| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3600| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:38:32,362 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:32,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3601|]. (let ((.cse0 (select |v_#memory_int_3601| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3601| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 23))) [2019-05-15 10:38:32,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:32,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,439 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,439 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3602|]. (let ((.cse0 (select |v_#memory_int_3602| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3602| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:38:32,439 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:32,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3603|]. (let ((.cse0 (select |v_#memory_int_3603| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3603| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:38:32,476 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:32,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,508 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,514 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,515 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3604|]. (let ((.cse0 (select |v_#memory_int_3604| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3604| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:38:32,515 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:32,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,555 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3605|]. (let ((.cse0 (select |v_#memory_int_3605| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3605| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:38:32,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:32,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3606|]. (let ((.cse0 (select |v_#memory_int_3606| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3606| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:32,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:32,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,640 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3607|]. (let ((.cse0 (select |v_#memory_int_3607| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3607| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:38:32,641 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:32,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,682 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3608|]. (let ((.cse0 (select |v_#memory_int_3608| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3608| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 30))) [2019-05-15 10:38:32,690 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:32,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3609|]. (let ((.cse0 (select |v_#memory_int_3609| ULTIMATE.start_main_p1))) (and (= 31 .cse0) (= (store |v_#memory_int_3609| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:32,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:32,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,779 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3610|]. (let ((.cse0 (select |v_#memory_int_3610| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3610| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:38:32,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:32,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,825 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,825 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3611|]. (let ((.cse0 (select |v_#memory_int_3611| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3611| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 33))) [2019-05-15 10:38:32,825 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:32,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3612|]. (let ((.cse0 (select |v_#memory_int_3612| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3612| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:38:32,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:32,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,918 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,918 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3613|]. (let ((.cse0 (select |v_#memory_int_3613| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3613| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:38:32,918 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:32,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:32,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:32,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:32,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:32,965 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:32,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3614|]. (let ((.cse0 (select |v_#memory_int_3614| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3614| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:38:32,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:33,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,014 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3615|]. (let ((.cse0 (select |v_#memory_int_3615| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3615| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:38:33,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38:33,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,063 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,063 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3616|]. (let ((.cse0 (select |v_#memory_int_3616| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3616| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:38:33,063 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:33,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,114 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,114 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3617|]. (let ((.cse0 (select |v_#memory_int_3617| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= (store |v_#memory_int_3617| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,114 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:33,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,166 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,166 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3618|]. (let ((.cse0 (select |v_#memory_int_3618| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_3618| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:33,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,218 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,219 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3619|]. (let ((.cse0 (select |v_#memory_int_3619| ULTIMATE.start_main_p1))) (and (= 41 .cse0) (= (store |v_#memory_int_3619| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,219 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:33,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3620|]. (let ((.cse0 (select |v_#memory_int_3620| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3620| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 42 .cse0))) [2019-05-15 10:38:33,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:33,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,333 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,333 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3621|]. (let ((.cse0 (select |v_#memory_int_3621| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_3621| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,333 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:33,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3622|]. (let ((.cse0 (select |v_#memory_int_3622| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3622| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:33,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3623|]. (let ((.cse0 (select |v_#memory_int_3623| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3623| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:38:33,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:33,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,495 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,495 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3624|]. (let ((.cse0 (select |v_#memory_int_3624| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3624| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 46))) [2019-05-15 10:38:33,495 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:33,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3625|]. (let ((.cse0 (select |v_#memory_int_3625| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_3625| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,551 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:33,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,608 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,608 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3626|]. (let ((.cse0 (select |v_#memory_int_3626| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3626| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:38:33,608 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:33,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,665 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3627|]. (let ((.cse0 (select |v_#memory_int_3627| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3627| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:33,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3628|]. (let ((.cse0 (select |v_#memory_int_3628| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3628| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:38:33,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:33,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,784 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,784 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3629|]. (let ((.cse0 (select |v_#memory_int_3629| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3629| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,784 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:33,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,843 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3630|]. (let ((.cse0 (select |v_#memory_int_3630| ULTIMATE.start_main_p1))) (and (= 52 .cse0) (= (store |v_#memory_int_3630| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:33,843 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:33,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3631|]. (let ((.cse0 (select |v_#memory_int_3631| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3631| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 53))) [2019-05-15 10:38:33,905 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:33,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:33,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:33,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:33,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:33,970 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:33,970 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3632|]. (let ((.cse0 (select |v_#memory_int_3632| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3632| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:38:33,970 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:34,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,038 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,039 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3633|]. (let ((.cse0 (select |v_#memory_int_3633| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= |#memory_int| (store |v_#memory_int_3633| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:34,039 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:34,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,102 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,102 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3634|]. (let ((.cse0 (select |v_#memory_int_3634| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3634| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:34,102 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:34,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,167 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,167 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3635|]. (let ((.cse0 (select |v_#memory_int_3635| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3635| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:38:34,167 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:34,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3636|]. (let ((.cse0 (select |v_#memory_int_3636| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3636| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:34,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:34,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,294 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,295 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3637|]. (let ((.cse0 (select |v_#memory_int_3637| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3637| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 59))) [2019-05-15 10:38:34,295 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:34,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,360 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,360 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3638|]. (let ((.cse0 (select |v_#memory_int_3638| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3638| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:38:34,360 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:34,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,426 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3639|]. (let ((.cse0 (select |v_#memory_int_3639| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3639| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 61))) [2019-05-15 10:38:34,426 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:34,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,494 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,494 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3640|]. (let ((.cse0 (select |v_#memory_int_3640| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3640| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 62 .cse0))) [2019-05-15 10:38:34,494 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:34,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3641|]. (let ((.cse0 (select |v_#memory_int_3641| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3641| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 63 .cse0))) [2019-05-15 10:38:34,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:34,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,634 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3642|]. (let ((.cse0 (select |v_#memory_int_3642| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= (store |v_#memory_int_3642| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:34,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:34,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,704 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,704 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3643|]. (let ((.cse0 (select |v_#memory_int_3643| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3643| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 65 .cse0))) [2019-05-15 10:38:34,704 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:34,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,774 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,774 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3644|]. (let ((.cse0 (select |v_#memory_int_3644| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3644| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:34,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:34,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,848 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,848 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3645|]. (let ((.cse0 (select |v_#memory_int_3645| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_3645| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:34,848 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:34,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,919 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3646|]. (let ((.cse0 (select |v_#memory_int_3646| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3646| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:38:34,919 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:34,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:34,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:34,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:34,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:34,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:34,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3647|]. (let ((.cse0 (select |v_#memory_int_3647| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= |#memory_int| (store |v_#memory_int_3647| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:34,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:35,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,066 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3648|]. (let ((.cse0 (select |v_#memory_int_3648| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_3648| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:35,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:35,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3649|]. (let ((.cse0 (select |v_#memory_int_3649| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3649| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:38:35,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:35,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,214 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,214 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3650|]. (let ((.cse0 (select |v_#memory_int_3650| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3650| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 72 .cse0))) [2019-05-15 10:38:35,214 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:35,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3651|]. (let ((.cse0 (select |v_#memory_int_3651| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3651| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 73 .cse0))) [2019-05-15 10:38:35,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38:35,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3652|]. (let ((.cse0 (select |v_#memory_int_3652| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3652| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:38:35,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:35,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3653|]. (let ((.cse0 (select |v_#memory_int_3653| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3653| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 75))) [2019-05-15 10:38:35,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:35,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3654|]. (let ((.cse0 (select |v_#memory_int_3654| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= (store |v_#memory_int_3654| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:35,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38:35,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3655|]. (let ((.cse0 (select |v_#memory_int_3655| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3655| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:38:35,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:35,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,681 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,681 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3656|]. (let ((.cse0 (select |v_#memory_int_3656| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3656| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:38:35,681 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:35,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3657|]. (let ((.cse0 (select |v_#memory_int_3657| ULTIMATE.start_main_p1))) (and (= 79 .cse0) (= (store |v_#memory_int_3657| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:35,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:35,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3658|]. (let ((.cse0 (select |v_#memory_int_3658| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3658| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:38:35,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:35,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:35,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:35,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:35,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:35,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:35,928 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3659|]. (let ((.cse0 (select |v_#memory_int_3659| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3659| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:38:35,928 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:36,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:36,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:36,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3660|]. (let ((.cse0 (select |v_#memory_int_3660| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3660| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:38:36,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:38:36,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:36,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:36,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:36,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:36,108 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:36,108 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3661|]. (let ((.cse0 (select |v_#memory_int_3661| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_3661| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:36,108 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:38:36,180 INFO L273 TraceCheckUtils]: 0: Hoare triple {31094#true} havoc main_p1; {31094#true} is VALID [2019-05-15 10:38:36,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {31094#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {31094#true} is VALID [2019-05-15 10:38:36,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {31094#true} #memory_int := #memory_int[main_p1 := 0]; {31105#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:36,181 INFO L273 TraceCheckUtils]: 3: Hoare triple {31105#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31109#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:36,181 INFO L273 TraceCheckUtils]: 4: Hoare triple {31109#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31113#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:36,182 INFO L273 TraceCheckUtils]: 5: Hoare triple {31113#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31117#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:36,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {31117#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31121#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:36,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {31121#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31125#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:36,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {31125#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31129#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:36,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {31129#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31133#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:36,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {31133#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31137#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:36,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {31137#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31141#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:36,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {31141#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31145#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:36,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {31145#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31149#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:36,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {31149#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31153#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:36,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {31153#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31157#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:36,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {31157#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31161#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:36,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {31161#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31165#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:36,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {31165#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31169#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:36,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {31169#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31173#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:36,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {31173#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31177#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:36,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {31177#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31181#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:36,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {31181#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31185#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:36,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {31185#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31189#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:36,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {31189#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31193#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:36,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {31193#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31197#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:36,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {31197#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31201#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:36,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {31201#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31205#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:36,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {31205#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31209#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:36,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {31209#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31213#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:36,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {31213#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31217#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:36,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {31217#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31221#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:36,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {31221#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31225#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:36,203 INFO L273 TraceCheckUtils]: 33: Hoare triple {31225#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31229#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:36,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {31229#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31233#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:36,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {31233#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31237#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:36,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {31237#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31241#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:36,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {31241#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31245#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:36,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {31245#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31249#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:36,208 INFO L273 TraceCheckUtils]: 39: Hoare triple {31249#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31253#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:36,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {31253#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31257#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:36,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {31257#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31261#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:36,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {31261#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31265#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:36,211 INFO L273 TraceCheckUtils]: 43: Hoare triple {31265#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31269#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:36,211 INFO L273 TraceCheckUtils]: 44: Hoare triple {31269#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31273#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:36,212 INFO L273 TraceCheckUtils]: 45: Hoare triple {31273#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31277#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:36,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {31277#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31281#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:36,214 INFO L273 TraceCheckUtils]: 47: Hoare triple {31281#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31285#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:36,214 INFO L273 TraceCheckUtils]: 48: Hoare triple {31285#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31289#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:36,215 INFO L273 TraceCheckUtils]: 49: Hoare triple {31289#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31293#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:36,216 INFO L273 TraceCheckUtils]: 50: Hoare triple {31293#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31297#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:36,217 INFO L273 TraceCheckUtils]: 51: Hoare triple {31297#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31301#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:36,217 INFO L273 TraceCheckUtils]: 52: Hoare triple {31301#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31305#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:36,218 INFO L273 TraceCheckUtils]: 53: Hoare triple {31305#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31309#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:36,219 INFO L273 TraceCheckUtils]: 54: Hoare triple {31309#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31313#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:36,220 INFO L273 TraceCheckUtils]: 55: Hoare triple {31313#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31317#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:36,220 INFO L273 TraceCheckUtils]: 56: Hoare triple {31317#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31321#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:36,221 INFO L273 TraceCheckUtils]: 57: Hoare triple {31321#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31325#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:36,222 INFO L273 TraceCheckUtils]: 58: Hoare triple {31325#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31329#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:36,223 INFO L273 TraceCheckUtils]: 59: Hoare triple {31329#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31333#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:36,223 INFO L273 TraceCheckUtils]: 60: Hoare triple {31333#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31337#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:36,224 INFO L273 TraceCheckUtils]: 61: Hoare triple {31337#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31341#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:36,225 INFO L273 TraceCheckUtils]: 62: Hoare triple {31341#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31345#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:36,226 INFO L273 TraceCheckUtils]: 63: Hoare triple {31345#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31349#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:36,226 INFO L273 TraceCheckUtils]: 64: Hoare triple {31349#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31353#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:36,227 INFO L273 TraceCheckUtils]: 65: Hoare triple {31353#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31357#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:36,228 INFO L273 TraceCheckUtils]: 66: Hoare triple {31357#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31361#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:36,229 INFO L273 TraceCheckUtils]: 67: Hoare triple {31361#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31365#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:36,229 INFO L273 TraceCheckUtils]: 68: Hoare triple {31365#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31369#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:36,230 INFO L273 TraceCheckUtils]: 69: Hoare triple {31369#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31373#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:36,231 INFO L273 TraceCheckUtils]: 70: Hoare triple {31373#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31377#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:36,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {31377#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31381#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:36,232 INFO L273 TraceCheckUtils]: 72: Hoare triple {31381#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31385#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:36,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {31385#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31389#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:36,234 INFO L273 TraceCheckUtils]: 74: Hoare triple {31389#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31393#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:36,235 INFO L273 TraceCheckUtils]: 75: Hoare triple {31393#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31397#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:36,235 INFO L273 TraceCheckUtils]: 76: Hoare triple {31397#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31401#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:36,236 INFO L273 TraceCheckUtils]: 77: Hoare triple {31401#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31405#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:36,237 INFO L273 TraceCheckUtils]: 78: Hoare triple {31405#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31409#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:36,238 INFO L273 TraceCheckUtils]: 79: Hoare triple {31409#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31413#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:36,238 INFO L273 TraceCheckUtils]: 80: Hoare triple {31413#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31417#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:36,239 INFO L273 TraceCheckUtils]: 81: Hoare triple {31417#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31421#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:36,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {31421#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31425#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:36,241 INFO L273 TraceCheckUtils]: 83: Hoare triple {31425#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31429#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:36,241 INFO L273 TraceCheckUtils]: 84: Hoare triple {31429#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31433#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:36,242 INFO L273 TraceCheckUtils]: 85: Hoare triple {31433#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31437#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:38:36,243 INFO L273 TraceCheckUtils]: 86: Hoare triple {31437#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31441#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:38:36,243 INFO L273 TraceCheckUtils]: 87: Hoare triple {31441#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} assume !(#memory_int[main_p1] >= 0); {31095#false} is VALID [2019-05-15 10:38:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:36,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:36,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-15 10:38:36,253 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-05-15 10:38:36,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:36,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states. [2019-05-15 10:38:36,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:36,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-05-15 10:38:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-15 10:38:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-05-15 10:38:36,327 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 87 states. [2019-05-15 10:38:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:51,422 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:38:51,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-15 10:38:51,422 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 88 [2019-05-15 10:38:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:38:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:38:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-05-15 10:38:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-05-15 10:38:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-05-15 10:38:51,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 87 states and 91 transitions. [2019-05-15 10:38:51,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:51,496 INFO L225 Difference]: With dead ends: 90 [2019-05-15 10:38:51,497 INFO L226 Difference]: Without dead ends: 90 [2019-05-15 10:38:51,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2019-05-15 10:38:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-05-15 10:38:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-05-15 10:38:51,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:38:51,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2019-05-15 10:38:51,499 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2019-05-15 10:38:51,499 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2019-05-15 10:38:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:51,500 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:38:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:38:51,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:51,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:51,501 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2019-05-15 10:38:51,501 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2019-05-15 10:38:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:38:51,502 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-05-15 10:38:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:38:51,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:38:51,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:38:51,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:38:51,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:38:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:38:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-05-15 10:38:51,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-05-15 10:38:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:38:51,503 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-05-15 10:38:51,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-05-15 10:38:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-05-15 10:38:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-05-15 10:38:51,504 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:38:51,504 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-05-15 10:38:51,504 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:38:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:38:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1514267842, now seen corresponding path program 85 times [2019-05-15 10:38:51,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:38:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:51,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-15 10:38:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:38:51,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:38:51,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:38:51,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:38:51,613 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,613 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3662|]. (= (store |v_#memory_int_3662| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:38:51,613 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:38:51,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,633 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,634 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3663|]. (let ((.cse0 (select |v_#memory_int_3663| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3663| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 .cse0))) [2019-05-15 10:38:51,634 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:38:51,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,653 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3664|]. (let ((.cse0 (select |v_#memory_int_3664| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3664| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:38:51,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:38:51,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3665|]. (let ((.cse0 (select |v_#memory_int_3665| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= (store |v_#memory_int_3665| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:51,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:38:51,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,696 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3666|]. (let ((.cse0 (select |v_#memory_int_3666| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3666| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:38:51,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:38:51,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,719 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,719 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3667|]. (let ((.cse0 (select |v_#memory_int_3667| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3667| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:38:51,719 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:38:51,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,742 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,742 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3668|]. (let ((.cse0 (select |v_#memory_int_3668| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3668| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:51,742 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:38:51,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3669|]. (let ((.cse0 (select |v_#memory_int_3669| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3669| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:38:51,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:38:51,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,790 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,791 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3670|]. (let ((.cse0 (select |v_#memory_int_3670| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3670| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:38:51,791 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:38:51,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3671|]. (let ((.cse0 (select |v_#memory_int_3671| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= |#memory_int| (store |v_#memory_int_3671| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:51,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:38:51,835 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,847 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,847 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3672|]. (let ((.cse0 (select |v_#memory_int_3672| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_3672| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:51,847 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:38:51,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3673|]. (let ((.cse0 (select |v_#memory_int_3673| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3673| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:38:51,873 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:38:51,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3674|]. (let ((.cse0 (select |v_#memory_int_3674| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3674| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 11))) [2019-05-15 10:38:51,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:38:51,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3675|]. (let ((.cse0 (select |v_#memory_int_3675| ULTIMATE.start_main_p1))) (and (= .cse0 12) (= (store |v_#memory_int_3675| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:51,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:38:51,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3676|]. (let ((.cse0 (select |v_#memory_int_3676| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3676| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:38:51,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:38:51,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:51,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:51,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:51,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:51,992 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:51,993 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3677|]. (let ((.cse0 (select |v_#memory_int_3677| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3677| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:38:51,993 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:38:52,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3678|]. (let ((.cse0 (select |v_#memory_int_3678| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3678| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 15))) [2019-05-15 10:38:52,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:38:52,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,055 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,056 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3679|]. (let ((.cse0 (select |v_#memory_int_3679| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3679| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:38:52,056 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:38:52,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,088 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3680|]. (let ((.cse0 (select |v_#memory_int_3680| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_3680| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,088 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:38:52,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,121 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,122 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3681|]. (let ((.cse0 (select |v_#memory_int_3681| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= (store |v_#memory_int_3681| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,122 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:38:52,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,156 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,156 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3682|]. (let ((.cse0 (select |v_#memory_int_3682| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= (store |v_#memory_int_3682| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,156 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:38:52,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,192 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3683|]. (let ((.cse0 (select |v_#memory_int_3683| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3683| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:38:52,192 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:38:52,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,227 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3684|]. (let ((.cse0 (select |v_#memory_int_3684| ULTIMATE.start_main_p1))) (and (= 21 .cse0) (= (store |v_#memory_int_3684| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:38:52,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,263 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,264 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3685|]. (let ((.cse0 (select |v_#memory_int_3685| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3685| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:38:52,264 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:38:52,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,309 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3686|]. (let ((.cse0 (select |v_#memory_int_3686| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_3686| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,309 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:38:52,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3687|]. (let ((.cse0 (select |v_#memory_int_3687| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_3687| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:52,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:38:52,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3688|]. (let ((.cse0 (select |v_#memory_int_3688| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_3688| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:52,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:38:52,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,424 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3689|]. (let ((.cse0 (select |v_#memory_int_3689| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3689| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:38:52,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:38:52,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,464 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3690|]. (let ((.cse0 (select |v_#memory_int_3690| ULTIMATE.start_main_p1))) (and (= 27 .cse0) (= |#memory_int| (store |v_#memory_int_3690| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:52,464 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:38:52,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,503 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3691|]. (let ((.cse0 (select |v_#memory_int_3691| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3691| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 28 .cse0))) [2019-05-15 10:38:52,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:38:52,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,538 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,546 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,546 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3692|]. (let ((.cse0 (select |v_#memory_int_3692| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_3692| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,547 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:38:52,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3693|]. (let ((.cse0 (select |v_#memory_int_3693| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3693| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:38:52,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:38:52,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,631 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,631 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3694|]. (let ((.cse0 (select |v_#memory_int_3694| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3694| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,631 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:38:52,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3695|]. (let ((.cse0 (select |v_#memory_int_3695| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3695| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 32 .cse0))) [2019-05-15 10:38:52,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:38:52,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,710 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,720 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,720 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3696|]. (let ((.cse0 (select |v_#memory_int_3696| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3696| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:38:52,720 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:38:52,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,765 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,765 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3697|]. (let ((.cse0 (select |v_#memory_int_3697| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_3697| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:38:52,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3698|]. (let ((.cse0 (select |v_#memory_int_3698| ULTIMATE.start_main_p1))) (and (= 35 .cse0) (= |#memory_int| (store |v_#memory_int_3698| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:52,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:38:52,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3699|]. (let ((.cse0 (select |v_#memory_int_3699| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3699| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:52,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:38:52,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,919 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3700|]. (let ((.cse0 (select |v_#memory_int_3700| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3700| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:38:52,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:38:52,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:52,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:52,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:52,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:52,969 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:52,969 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3701|]. (let ((.cse0 (select |v_#memory_int_3701| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3701| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:38:52,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:38:53,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3702|]. (let ((.cse0 (select |v_#memory_int_3702| ULTIMATE.start_main_p1))) (and (= 39 .cse0) (= (store |v_#memory_int_3702| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,025 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:38:53,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,077 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,077 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3703|]. (let ((.cse0 (select |v_#memory_int_3703| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3703| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:38:53,078 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:38:53,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,130 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3704|]. (let ((.cse0 (select |v_#memory_int_3704| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= |#memory_int| (store |v_#memory_int_3704| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:53,130 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:38:53,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,179 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3705|]. (let ((.cse0 (select |v_#memory_int_3705| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= |#memory_int| (store |v_#memory_int_3705| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:53,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:38:53,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,231 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3706|]. (let ((.cse0 (select |v_#memory_int_3706| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= |#memory_int| (store |v_#memory_int_3706| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:53,232 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:38:53,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3707|]. (let ((.cse0 (select |v_#memory_int_3707| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3707| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,285 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:38:53,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3708|]. (let ((.cse0 (select |v_#memory_int_3708| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3708| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:38:53,345 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:38:53,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,405 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,406 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3709|]. (let ((.cse0 (select |v_#memory_int_3709| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3709| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 46 .cse0))) [2019-05-15 10:38:53,406 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:38:53,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,466 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,466 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3710|]. (let ((.cse0 (select |v_#memory_int_3710| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= (store |v_#memory_int_3710| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,466 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:38:53,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,527 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,528 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3711|]. (let ((.cse0 (select |v_#memory_int_3711| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3711| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:38:53,528 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:38:53,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,588 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,588 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3712|]. (let ((.cse0 (select |v_#memory_int_3712| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= (store |v_#memory_int_3712| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,588 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:38:53,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,644 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,644 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3713|]. (let ((.cse0 (select |v_#memory_int_3713| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3713| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,645 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:38:53,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3714|]. (let ((.cse0 (select |v_#memory_int_3714| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_3714| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,703 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:38:53,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,761 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,761 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3715|]. (let ((.cse0 (select |v_#memory_int_3715| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3715| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 52))) [2019-05-15 10:38:53,761 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:38:53,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,820 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,821 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3716|]. (let ((.cse0 (select |v_#memory_int_3716| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3716| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,821 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:38:53,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,880 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,880 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3717|]. (let ((.cse0 (select |v_#memory_int_3717| ULTIMATE.start_main_p1))) (and (= 54 .cse0) (= (store |v_#memory_int_3717| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:53,880 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:38:53,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:53,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:53,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:53,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:53,942 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:53,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3718|]. (let ((.cse0 (select |v_#memory_int_3718| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3718| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:38:53,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:38:54,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,012 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,012 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3719|]. (let ((.cse0 (select |v_#memory_int_3719| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3719| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:38:54,012 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:38:54,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3720|]. (let ((.cse0 (select |v_#memory_int_3720| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= (store |v_#memory_int_3720| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:38:54,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,139 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,139 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3721|]. (let ((.cse0 (select |v_#memory_int_3721| ULTIMATE.start_main_p1))) (and (= .cse0 58) (= (store |v_#memory_int_3721| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:38:54,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3722|]. (let ((.cse0 (select |v_#memory_int_3722| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= (store |v_#memory_int_3722| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,204 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:38:54,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3723|]. (let ((.cse0 (select |v_#memory_int_3723| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3723| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 60 .cse0))) [2019-05-15 10:38:54,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:38:54,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,346 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,346 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3724|]. (let ((.cse0 (select |v_#memory_int_3724| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3724| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:38:54,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,413 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,413 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3725|]. (let ((.cse0 (select |v_#memory_int_3725| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_3725| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,413 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:38:54,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3726|]. (let ((.cse0 (select |v_#memory_int_3726| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3726| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:38:54,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:38:54,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,557 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,557 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3727|]. (let ((.cse0 (select |v_#memory_int_3727| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= (store |v_#memory_int_3727| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:54,558 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:38:54,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3728|]. (let ((.cse0 (select |v_#memory_int_3728| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_3728| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:54,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:38:54,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3729|]. (let ((.cse0 (select |v_#memory_int_3729| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3729| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:38:54,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:38:54,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3730|]. (let ((.cse0 (select |v_#memory_int_3730| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3730| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 67 .cse0))) [2019-05-15 10:38:54,766 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:38:54,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3731|]. (let ((.cse0 (select |v_#memory_int_3731| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3731| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:38:54,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:38:54,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,910 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,910 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3732|]. (let ((.cse0 (select |v_#memory_int_3732| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3732| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:38:54,911 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:38:54,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:54,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:54,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:54,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:54,985 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:54,985 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3733|]. (let ((.cse0 (select |v_#memory_int_3733| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3733| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:38:54,985 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:38:55,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,061 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,061 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3734|]. (let ((.cse0 (select |v_#memory_int_3734| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3734| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 71 .cse0))) [2019-05-15 10:38:55,061 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:38:55,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,137 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,137 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3735|]. (let ((.cse0 (select |v_#memory_int_3735| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3735| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:55,137 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:38:55,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3736|]. (let ((.cse0 (select |v_#memory_int_3736| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_3736| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:55,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:38:55,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3737|]. (let ((.cse0 (select |v_#memory_int_3737| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3737| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:38:55,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:38:55,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,376 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,376 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3738|]. (let ((.cse0 (select |v_#memory_int_3738| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3738| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:38:55,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:38:55,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,445 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,453 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,453 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3739|]. (let ((.cse0 (select |v_#memory_int_3739| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= |#memory_int| (store |v_#memory_int_3739| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:55,453 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:38:55,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,530 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,531 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3740|]. (let ((.cse0 (select |v_#memory_int_3740| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3740| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:38:55,531 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:38:55,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3741|]. (let ((.cse0 (select |v_#memory_int_3741| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3741| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:55,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:38:55,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,697 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,697 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3742|]. (let ((.cse0 (select |v_#memory_int_3742| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3742| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:38:55,697 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:38:55,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,778 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,779 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3743|]. (let ((.cse0 (select |v_#memory_int_3743| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3743| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:38:55,779 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:38:55,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3744|]. (let ((.cse0 (select |v_#memory_int_3744| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3744| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 81 .cse0))) [2019-05-15 10:38:55,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:38:55,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:55,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:55,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:55,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:55,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:55,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3745|]. (let ((.cse0 (select |v_#memory_int_3745| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= |#memory_int| (store |v_#memory_int_3745| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:38:55,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:38:56,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:56,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:56,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:56,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:56,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:56,021 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:56,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3746|]. (let ((.cse0 (select |v_#memory_int_3746| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_3746| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:56,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:38:56,094 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:38:56,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:38:56,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:38:56,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:38:56,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:38:56,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:38:56,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3747|]. (let ((.cse0 (select |v_#memory_int_3747| ULTIMATE.start_main_p1))) (and (= 84 .cse0) (= (store |v_#memory_int_3747| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:38:56,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:38:56,172 INFO L273 TraceCheckUtils]: 0: Hoare triple {31804#true} havoc main_p1; {31804#true} is VALID [2019-05-15 10:38:56,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {31804#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {31804#true} is VALID [2019-05-15 10:38:56,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {31804#true} #memory_int := #memory_int[main_p1 := 0]; {31815#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:38:56,173 INFO L273 TraceCheckUtils]: 3: Hoare triple {31815#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31819#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:38:56,173 INFO L273 TraceCheckUtils]: 4: Hoare triple {31819#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31823#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:38:56,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {31823#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31827#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:38:56,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {31827#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31831#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:38:56,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {31831#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31835#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:38:56,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {31835#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31839#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:38:56,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {31839#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31843#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:38:56,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {31843#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31847#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:38:56,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {31847#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31851#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:38:56,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {31851#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31855#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:38:56,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {31855#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31859#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:38:56,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {31859#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31863#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:38:56,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {31863#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31867#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:38:56,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {31867#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31871#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:38:56,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {31871#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31875#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:38:56,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {31875#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31879#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:38:56,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {31879#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31883#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:38:56,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {31883#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31887#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:38:56,185 INFO L273 TraceCheckUtils]: 21: Hoare triple {31887#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31891#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:38:56,186 INFO L273 TraceCheckUtils]: 22: Hoare triple {31891#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31895#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:38:56,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {31895#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31899#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:38:56,187 INFO L273 TraceCheckUtils]: 24: Hoare triple {31899#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31903#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:38:56,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {31903#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31907#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:38:56,189 INFO L273 TraceCheckUtils]: 26: Hoare triple {31907#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31911#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:38:56,189 INFO L273 TraceCheckUtils]: 27: Hoare triple {31911#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31915#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:38:56,190 INFO L273 TraceCheckUtils]: 28: Hoare triple {31915#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31919#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:38:56,191 INFO L273 TraceCheckUtils]: 29: Hoare triple {31919#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31923#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:38:56,192 INFO L273 TraceCheckUtils]: 30: Hoare triple {31923#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31927#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:38:56,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {31927#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31931#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:38:56,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {31931#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31935#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:38:56,194 INFO L273 TraceCheckUtils]: 33: Hoare triple {31935#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31939#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:38:56,195 INFO L273 TraceCheckUtils]: 34: Hoare triple {31939#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31943#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:38:56,195 INFO L273 TraceCheckUtils]: 35: Hoare triple {31943#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31947#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:38:56,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {31947#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31951#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:38:56,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {31951#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31955#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:38:56,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {31955#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31959#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:38:56,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {31959#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31963#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:38:56,199 INFO L273 TraceCheckUtils]: 40: Hoare triple {31963#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31967#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:38:56,200 INFO L273 TraceCheckUtils]: 41: Hoare triple {31967#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31971#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:38:56,201 INFO L273 TraceCheckUtils]: 42: Hoare triple {31971#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31975#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:38:56,201 INFO L273 TraceCheckUtils]: 43: Hoare triple {31975#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31979#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:38:56,202 INFO L273 TraceCheckUtils]: 44: Hoare triple {31979#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31983#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:38:56,203 INFO L273 TraceCheckUtils]: 45: Hoare triple {31983#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31987#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:38:56,204 INFO L273 TraceCheckUtils]: 46: Hoare triple {31987#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31991#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:38:56,204 INFO L273 TraceCheckUtils]: 47: Hoare triple {31991#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31995#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:38:56,205 INFO L273 TraceCheckUtils]: 48: Hoare triple {31995#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {31999#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:38:56,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {31999#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32003#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:38:56,206 INFO L273 TraceCheckUtils]: 50: Hoare triple {32003#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32007#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:38:56,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {32007#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32011#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:38:56,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {32011#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32015#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:38:56,209 INFO L273 TraceCheckUtils]: 53: Hoare triple {32015#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32019#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:38:56,209 INFO L273 TraceCheckUtils]: 54: Hoare triple {32019#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32023#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:38:56,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {32023#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32027#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:38:56,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {32027#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32031#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:38:56,212 INFO L273 TraceCheckUtils]: 57: Hoare triple {32031#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32035#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:38:56,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {32035#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32039#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:38:56,213 INFO L273 TraceCheckUtils]: 59: Hoare triple {32039#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32043#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:38:56,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {32043#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32047#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:38:56,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {32047#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32051#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:38:56,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {32051#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32055#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:38:56,216 INFO L273 TraceCheckUtils]: 63: Hoare triple {32055#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32059#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:38:56,217 INFO L273 TraceCheckUtils]: 64: Hoare triple {32059#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32063#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:38:56,218 INFO L273 TraceCheckUtils]: 65: Hoare triple {32063#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32067#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:38:56,218 INFO L273 TraceCheckUtils]: 66: Hoare triple {32067#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32071#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:38:56,219 INFO L273 TraceCheckUtils]: 67: Hoare triple {32071#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32075#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:38:56,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {32075#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32079#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:38:56,221 INFO L273 TraceCheckUtils]: 69: Hoare triple {32079#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32083#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:38:56,221 INFO L273 TraceCheckUtils]: 70: Hoare triple {32083#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32087#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:38:56,222 INFO L273 TraceCheckUtils]: 71: Hoare triple {32087#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32091#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:38:56,223 INFO L273 TraceCheckUtils]: 72: Hoare triple {32091#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32095#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:38:56,224 INFO L273 TraceCheckUtils]: 73: Hoare triple {32095#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32099#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:38:56,224 INFO L273 TraceCheckUtils]: 74: Hoare triple {32099#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32103#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:38:56,225 INFO L273 TraceCheckUtils]: 75: Hoare triple {32103#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32107#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:38:56,226 INFO L273 TraceCheckUtils]: 76: Hoare triple {32107#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32111#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:38:56,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {32111#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32115#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:38:56,227 INFO L273 TraceCheckUtils]: 78: Hoare triple {32115#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32119#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:38:56,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {32119#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32123#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:38:56,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {32123#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32127#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:38:56,230 INFO L273 TraceCheckUtils]: 81: Hoare triple {32127#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32131#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:38:56,230 INFO L273 TraceCheckUtils]: 82: Hoare triple {32131#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32135#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:38:56,231 INFO L273 TraceCheckUtils]: 83: Hoare triple {32135#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32139#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:38:56,232 INFO L273 TraceCheckUtils]: 84: Hoare triple {32139#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32143#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:38:56,233 INFO L273 TraceCheckUtils]: 85: Hoare triple {32143#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32147#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:38:56,233 INFO L273 TraceCheckUtils]: 86: Hoare triple {32147#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32151#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:38:56,234 INFO L273 TraceCheckUtils]: 87: Hoare triple {32151#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32155#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:38:56,235 INFO L273 TraceCheckUtils]: 88: Hoare triple {32155#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} assume !(#memory_int[main_p1] >= 0); {31805#false} is VALID [2019-05-15 10:38:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:38:56,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:38:56,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-15 10:38:56,245 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-05-15 10:38:56,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:38:56,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states. [2019-05-15 10:38:56,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:38:56,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-05-15 10:38:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-15 10:38:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:38:56,409 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 88 states. [2019-05-15 10:39:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,518 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-15 10:39:11,519 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 89 [2019-05-15 10:39:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:39:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:39:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-05-15 10:39:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-05-15 10:39:11,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2019-05-15 10:39:11,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:11,595 INFO L225 Difference]: With dead ends: 91 [2019-05-15 10:39:11,596 INFO L226 Difference]: Without dead ends: 91 [2019-05-15 10:39:11,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2019-05-15 10:39:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-05-15 10:39:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-05-15 10:39:11,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:11,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:11,598 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:11,598 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,599 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:11,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:11,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:11,600 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:11,600 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states. [2019-05-15 10:39:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:11,601 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-05-15 10:39:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:11,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:11,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:11,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:11,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:39:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-05-15 10:39:11,602 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-05-15 10:39:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:11,603 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-05-15 10:39:11,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-05-15 10:39:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-05-15 10:39:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-05-15 10:39:11,603 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:11,603 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-05-15 10:39:11,603 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:11,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:11,603 INFO L82 PathProgramCache]: Analyzing trace with hash -302337208, now seen corresponding path program 86 times [2019-05-15 10:39:11,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:11,646 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-15 10:39:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:11,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:11,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:39:11,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:11,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:11,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:11,864 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:11,864 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3748|]. (= (store |v_#memory_int_3748| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:11,864 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:12,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,095 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,095 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3749|]. (let ((.cse0 (select |v_#memory_int_3749| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3749| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:39:12,095 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:12,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,115 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3750|]. (let ((.cse0 (select |v_#memory_int_3750| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3750| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 1 .cse0))) [2019-05-15 10:39:12,115 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:12,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3751|]. (let ((.cse0 (select |v_#memory_int_3751| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3751| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 2))) [2019-05-15 10:39:12,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:12,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,158 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3752|]. (let ((.cse0 (select |v_#memory_int_3752| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3752| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 3))) [2019-05-15 10:39:12,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:12,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3753|]. (let ((.cse0 (select |v_#memory_int_3753| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3753| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:39:12,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:12,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,204 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,204 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3754|]. (let ((.cse0 (select |v_#memory_int_3754| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= |#memory_int| (store |v_#memory_int_3754| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:12,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:12,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,228 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,232 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3755|]. (let ((.cse0 (select |v_#memory_int_3755| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3755| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 6 .cse0))) [2019-05-15 10:39:12,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:12,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,259 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,260 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3756|]. (let ((.cse0 (select |v_#memory_int_3756| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3756| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:39:12,260 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:12,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3757|]. (let ((.cse0 (select |v_#memory_int_3757| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3757| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 8))) [2019-05-15 10:39:12,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:12,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,312 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3758|]. (let ((.cse0 (select |v_#memory_int_3758| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3758| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:39:12,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:12,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,338 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,338 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3759|]. (let ((.cse0 (select |v_#memory_int_3759| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3759| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 10))) [2019-05-15 10:39:12,338 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:12,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,360 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,368 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,368 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3760|]. (let ((.cse0 (select |v_#memory_int_3760| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3760| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:12,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,396 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,397 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3761|]. (let ((.cse0 (select |v_#memory_int_3761| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3761| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 12))) [2019-05-15 10:39:12,397 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:12,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,426 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,427 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3762|]. (let ((.cse0 (select |v_#memory_int_3762| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= |#memory_int| (store |v_#memory_int_3762| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:12,427 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:12,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3763|]. (let ((.cse0 (select |v_#memory_int_3763| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= |#memory_int| (store |v_#memory_int_3763| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:12,456 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:12,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,487 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,488 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3764|]. (let ((.cse0 (select |v_#memory_int_3764| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3764| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 15 .cse0))) [2019-05-15 10:39:12,488 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:12,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,518 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,518 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3765|]. (let ((.cse0 (select |v_#memory_int_3765| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= (store |v_#memory_int_3765| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,518 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:12,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,550 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,550 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3766|]. (let ((.cse0 (select |v_#memory_int_3766| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3766| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 17))) [2019-05-15 10:39:12,550 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:12,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3767|]. (let ((.cse0 (select |v_#memory_int_3767| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3767| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:39:12,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:12,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,617 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,617 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3768|]. (let ((.cse0 (select |v_#memory_int_3768| ULTIMATE.start_main_p1))) (and (= 19 .cse0) (= (store |v_#memory_int_3768| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,617 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:12,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,652 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,653 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3769|]. (let ((.cse0 (select |v_#memory_int_3769| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_3769| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,653 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:12,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,680 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3770|]. (let ((.cse0 (select |v_#memory_int_3770| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3770| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:39:12,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39:12,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3771|]. (let ((.cse0 (select |v_#memory_int_3771| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3771| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 22 .cse0))) [2019-05-15 10:39:12,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:12,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,768 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,768 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3772|]. (let ((.cse0 (select |v_#memory_int_3772| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= |#memory_int| (store |v_#memory_int_3772| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:12,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:12,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,806 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,806 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3773|]. (let ((.cse0 (select |v_#memory_int_3773| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_3773| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,806 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:12,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3774|]. (let ((.cse0 (select |v_#memory_int_3774| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_3774| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:12,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:12,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,887 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,887 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3775|]. (let ((.cse0 (select |v_#memory_int_3775| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3775| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 26 .cse0))) [2019-05-15 10:39:12,887 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:12,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3776|]. (let ((.cse0 (select |v_#memory_int_3776| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3776| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 27))) [2019-05-15 10:39:12,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:12,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:12,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:12,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:12,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:12,975 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:12,975 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3777|]. (let ((.cse0 (select |v_#memory_int_3777| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_3777| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:12,975 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:13,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,015 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,015 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3778|]. (let ((.cse0 (select |v_#memory_int_3778| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3778| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 29 .cse0))) [2019-05-15 10:39:13,015 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:13,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,057 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,057 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3779|]. (let ((.cse0 (select |v_#memory_int_3779| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3779| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 30 .cse0))) [2019-05-15 10:39:13,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:13,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3780|]. (let ((.cse0 (select |v_#memory_int_3780| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3780| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:13,100 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:13,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3781|]. (let ((.cse0 (select |v_#memory_int_3781| ULTIMATE.start_main_p1))) (and (= 32 .cse0) (= |#memory_int| (store |v_#memory_int_3781| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:13,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:13,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3782|]. (let ((.cse0 (select |v_#memory_int_3782| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3782| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:39:13,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:13,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,239 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,239 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3783|]. (let ((.cse0 (select |v_#memory_int_3783| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3783| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 34))) [2019-05-15 10:39:13,239 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:13,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,286 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3784|]. (let ((.cse0 (select |v_#memory_int_3784| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3784| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 35 .cse0))) [2019-05-15 10:39:13,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:13,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3785|]. (let ((.cse0 (select |v_#memory_int_3785| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= (store |v_#memory_int_3785| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:13,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39:13,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,384 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,384 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3786|]. (let ((.cse0 (select |v_#memory_int_3786| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3786| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 37))) [2019-05-15 10:39:13,384 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:13,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,432 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3787|]. (let ((.cse0 (select |v_#memory_int_3787| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3787| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:39:13,433 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:13,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,483 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3788|]. (let ((.cse0 (select |v_#memory_int_3788| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3788| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:39:13,483 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:13,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,536 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,537 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3789|]. (let ((.cse0 (select |v_#memory_int_3789| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3789| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 40 .cse0))) [2019-05-15 10:39:13,537 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:13,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,586 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,586 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3790|]. (let ((.cse0 (select |v_#memory_int_3790| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3790| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 41))) [2019-05-15 10:39:13,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:13,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,640 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3791|]. (let ((.cse0 (select |v_#memory_int_3791| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= |#memory_int| (store |v_#memory_int_3791| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:13,640 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:13,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,695 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3792|]. (let ((.cse0 (select |v_#memory_int_3792| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3792| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 43 .cse0))) [2019-05-15 10:39:13,695 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:13,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,748 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3793|]. (let ((.cse0 (select |v_#memory_int_3793| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= |#memory_int| (store |v_#memory_int_3793| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:13,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:13,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,802 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,802 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3794|]. (let ((.cse0 (select |v_#memory_int_3794| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3794| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 45))) [2019-05-15 10:39:13,802 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:13,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,861 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,861 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3795|]. (let ((.cse0 (select |v_#memory_int_3795| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= (store |v_#memory_int_3795| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:13,861 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:13,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3796|]. (let ((.cse0 (select |v_#memory_int_3796| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3796| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:13,917 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:13,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:13,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:13,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:13,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:13,973 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:13,973 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3797|]. (let ((.cse0 (select |v_#memory_int_3797| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3797| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 48))) [2019-05-15 10:39:13,973 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:14,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3798|]. (let ((.cse0 (select |v_#memory_int_3798| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3798| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 49))) [2019-05-15 10:39:14,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:14,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,091 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,091 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3799|]. (let ((.cse0 (select |v_#memory_int_3799| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_3799| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:14,091 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:14,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,154 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,155 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3800|]. (let ((.cse0 (select |v_#memory_int_3800| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3800| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 51 .cse0))) [2019-05-15 10:39:14,155 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:14,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,218 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3801|]. (let ((.cse0 (select |v_#memory_int_3801| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3801| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:39:14,218 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:14,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3802|]. (let ((.cse0 (select |v_#memory_int_3802| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_3802| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:14,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:14,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,339 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,339 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3803|]. (let ((.cse0 (select |v_#memory_int_3803| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3803| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:39:14,339 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:14,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,401 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,401 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3804|]. (let ((.cse0 (select |v_#memory_int_3804| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3804| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:39:14,401 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:14,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,462 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3805|]. (let ((.cse0 (select |v_#memory_int_3805| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3805| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:39:14,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:14,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,526 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,526 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3806|]. (let ((.cse0 (select |v_#memory_int_3806| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3806| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 57 .cse0))) [2019-05-15 10:39:14,526 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:14,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,592 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,592 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3807|]. (let ((.cse0 (select |v_#memory_int_3807| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3807| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:39:14,592 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39:14,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3808|]. (let ((.cse0 (select |v_#memory_int_3808| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3808| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:14,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:14,711 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,723 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,723 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3809|]. (let ((.cse0 (select |v_#memory_int_3809| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= (store |v_#memory_int_3809| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:14,723 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:14,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,791 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3810|]. (let ((.cse0 (select |v_#memory_int_3810| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3810| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 61))) [2019-05-15 10:39:14,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:14,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,858 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,858 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3811|]. (let ((.cse0 (select |v_#memory_int_3811| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_3811| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:14,858 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:14,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,927 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,927 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3812|]. (let ((.cse0 (select |v_#memory_int_3812| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= |#memory_int| (store |v_#memory_int_3812| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:14,927 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:14,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:14,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:14,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:14,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:14,996 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:14,996 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3813|]. (let ((.cse0 (select |v_#memory_int_3813| ULTIMATE.start_main_p1))) (and (= 64 .cse0) (= |#memory_int| (store |v_#memory_int_3813| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:14,997 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:15,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,067 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3814|]. (let ((.cse0 (select |v_#memory_int_3814| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3814| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 65 .cse0))) [2019-05-15 10:39:15,067 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39:15,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,136 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,136 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3815|]. (let ((.cse0 (select |v_#memory_int_3815| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3815| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:39:15,136 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:15,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,205 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,205 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3816|]. (let ((.cse0 (select |v_#memory_int_3816| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= |#memory_int| (store |v_#memory_int_3816| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:15,205 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:15,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3817|]. (let ((.cse0 (select |v_#memory_int_3817| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3817| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 68))) [2019-05-15 10:39:15,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:15,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3818|]. (let ((.cse0 (select |v_#memory_int_3818| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3818| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:39:15,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:15,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,431 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,431 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3819|]. (let ((.cse0 (select |v_#memory_int_3819| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= |#memory_int| (store |v_#memory_int_3819| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:15,431 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:15,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,504 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,504 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3820|]. (let ((.cse0 (select |v_#memory_int_3820| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3820| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 71 .cse0))) [2019-05-15 10:39:15,504 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:15,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,580 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,580 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3821|]. (let ((.cse0 (select |v_#memory_int_3821| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3821| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:15,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:15,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3822|]. (let ((.cse0 (select |v_#memory_int_3822| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3822| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:39:15,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:15,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,727 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,727 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3823|]. (let ((.cse0 (select |v_#memory_int_3823| ULTIMATE.start_main_p1))) (and (= 74 .cse0) (= |#memory_int| (store |v_#memory_int_3823| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:15,727 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:15,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,804 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3824|]. (let ((.cse0 (select |v_#memory_int_3824| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3824| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:39:15,804 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:15,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,883 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3825|]. (let ((.cse0 (select |v_#memory_int_3825| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_3825| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:15,883 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:15,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:15,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:15,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:15,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:15,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:15,962 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3826|]. (let ((.cse0 (select |v_#memory_int_3826| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3826| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 77))) [2019-05-15 10:39:15,962 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:16,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,045 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,045 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3827|]. (let ((.cse0 (select |v_#memory_int_3827| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3827| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:39:16,045 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:16,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,128 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,128 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3828|]. (let ((.cse0 (select |v_#memory_int_3828| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= (store |v_#memory_int_3828| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:16,128 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:16,200 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,211 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,211 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3829|]. (let ((.cse0 (select |v_#memory_int_3829| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3829| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 80 .cse0))) [2019-05-15 10:39:16,211 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:16,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,293 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,293 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3830|]. (let ((.cse0 (select |v_#memory_int_3830| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3830| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:39:16,293 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:16,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,377 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,377 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3831|]. (let ((.cse0 (select |v_#memory_int_3831| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3831| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 82 .cse0))) [2019-05-15 10:39:16,377 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39:16,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,458 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,458 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3832|]. (let ((.cse0 (select |v_#memory_int_3832| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3832| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 83))) [2019-05-15 10:39:16,458 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:16,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3833|]. (let ((.cse0 (select |v_#memory_int_3833| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3833| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 84 .cse0))) [2019-05-15 10:39:16,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:16,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:16,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:16,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:16,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:16,629 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:16,629 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3834|]. (let ((.cse0 (select |v_#memory_int_3834| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3834| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 85 .cse0))) [2019-05-15 10:39:16,629 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:39:16,700 INFO L273 TraceCheckUtils]: 0: Hoare triple {32522#true} havoc main_p1; {32522#true} is VALID [2019-05-15 10:39:16,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {32522#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {32522#true} is VALID [2019-05-15 10:39:16,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {32522#true} #memory_int := #memory_int[main_p1 := 0]; {32533#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:16,701 INFO L273 TraceCheckUtils]: 3: Hoare triple {32533#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32537#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:16,702 INFO L273 TraceCheckUtils]: 4: Hoare triple {32537#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32541#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:16,703 INFO L273 TraceCheckUtils]: 5: Hoare triple {32541#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32545#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:16,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {32545#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32549#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:16,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {32549#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32553#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:16,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {32553#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32557#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:16,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {32557#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32561#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:16,707 INFO L273 TraceCheckUtils]: 10: Hoare triple {32561#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32565#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:16,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {32565#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32569#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:16,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {32569#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32573#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:16,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {32573#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32577#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:16,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {32577#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32581#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:16,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {32581#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32585#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:16,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {32585#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32589#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:16,712 INFO L273 TraceCheckUtils]: 17: Hoare triple {32589#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32593#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:16,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {32593#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32597#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:16,714 INFO L273 TraceCheckUtils]: 19: Hoare triple {32597#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32601#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:16,715 INFO L273 TraceCheckUtils]: 20: Hoare triple {32601#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32605#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:16,715 INFO L273 TraceCheckUtils]: 21: Hoare triple {32605#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32609#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:16,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {32609#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32613#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:16,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {32613#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32617#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:16,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {32617#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32621#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:16,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {32621#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32625#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:16,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {32625#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32629#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:16,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {32629#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32633#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:16,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {32633#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32637#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:16,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {32637#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32641#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:16,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {32641#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32645#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:16,723 INFO L273 TraceCheckUtils]: 31: Hoare triple {32645#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32649#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:16,724 INFO L273 TraceCheckUtils]: 32: Hoare triple {32649#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32653#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:16,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {32653#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32657#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:16,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {32657#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32661#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:16,726 INFO L273 TraceCheckUtils]: 35: Hoare triple {32661#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32665#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:16,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {32665#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32669#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:16,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {32669#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32673#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:16,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {32673#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32677#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:16,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {32677#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32681#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:16,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {32681#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32685#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:16,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {32685#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32689#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:16,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {32689#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32693#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:16,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {32693#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32697#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:16,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {32697#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32701#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:16,733 INFO L273 TraceCheckUtils]: 45: Hoare triple {32701#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32705#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:16,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {32705#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32709#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:16,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {32709#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32713#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:16,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {32713#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32717#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:16,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {32717#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32721#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:16,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {32721#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32725#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:16,738 INFO L273 TraceCheckUtils]: 51: Hoare triple {32725#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32729#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:16,739 INFO L273 TraceCheckUtils]: 52: Hoare triple {32729#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32733#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:16,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {32733#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32737#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:16,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {32737#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32741#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:16,741 INFO L273 TraceCheckUtils]: 55: Hoare triple {32741#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32745#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:16,742 INFO L273 TraceCheckUtils]: 56: Hoare triple {32745#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32749#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:16,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {32749#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32753#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:16,743 INFO L273 TraceCheckUtils]: 58: Hoare triple {32753#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32757#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:16,744 INFO L273 TraceCheckUtils]: 59: Hoare triple {32757#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32761#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:16,745 INFO L273 TraceCheckUtils]: 60: Hoare triple {32761#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32765#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:16,745 INFO L273 TraceCheckUtils]: 61: Hoare triple {32765#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32769#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:16,746 INFO L273 TraceCheckUtils]: 62: Hoare triple {32769#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32773#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:16,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {32773#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32777#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:16,748 INFO L273 TraceCheckUtils]: 64: Hoare triple {32777#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32781#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:16,748 INFO L273 TraceCheckUtils]: 65: Hoare triple {32781#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32785#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:16,749 INFO L273 TraceCheckUtils]: 66: Hoare triple {32785#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32789#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:16,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {32789#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32793#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:16,751 INFO L273 TraceCheckUtils]: 68: Hoare triple {32793#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32797#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:16,751 INFO L273 TraceCheckUtils]: 69: Hoare triple {32797#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32801#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:16,752 INFO L273 TraceCheckUtils]: 70: Hoare triple {32801#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32805#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:16,758 INFO L273 TraceCheckUtils]: 71: Hoare triple {32805#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32809#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:16,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {32809#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32813#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:16,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {32813#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32817#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:16,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {32817#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32821#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:16,760 INFO L273 TraceCheckUtils]: 75: Hoare triple {32821#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32825#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:16,760 INFO L273 TraceCheckUtils]: 76: Hoare triple {32825#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32829#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:16,761 INFO L273 TraceCheckUtils]: 77: Hoare triple {32829#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32833#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:16,761 INFO L273 TraceCheckUtils]: 78: Hoare triple {32833#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32837#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:16,762 INFO L273 TraceCheckUtils]: 79: Hoare triple {32837#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32841#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:16,763 INFO L273 TraceCheckUtils]: 80: Hoare triple {32841#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32845#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:16,764 INFO L273 TraceCheckUtils]: 81: Hoare triple {32845#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32849#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:16,764 INFO L273 TraceCheckUtils]: 82: Hoare triple {32849#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32853#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:16,765 INFO L273 TraceCheckUtils]: 83: Hoare triple {32853#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32857#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:16,766 INFO L273 TraceCheckUtils]: 84: Hoare triple {32857#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32861#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:16,767 INFO L273 TraceCheckUtils]: 85: Hoare triple {32861#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32865#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:16,767 INFO L273 TraceCheckUtils]: 86: Hoare triple {32865#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32869#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:16,768 INFO L273 TraceCheckUtils]: 87: Hoare triple {32869#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32873#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:16,769 INFO L273 TraceCheckUtils]: 88: Hoare triple {32873#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {32877#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:39:16,770 INFO L273 TraceCheckUtils]: 89: Hoare triple {32877#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} assume !(#memory_int[main_p1] >= 0); {32523#false} is VALID [2019-05-15 10:39:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:16,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:16,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-15 10:39:16,780 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-05-15 10:39:16,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:16,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 89 states. [2019-05-15 10:39:16,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:16,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-05-15 10:39:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-15 10:39:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-05-15 10:39:16,856 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 89 states. [2019-05-15 10:39:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:32,535 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:32,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-15 10:39:32,535 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 90 [2019-05-15 10:39:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:39:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-05-15 10:39:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-05-15 10:39:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-05-15 10:39:32,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 89 states and 93 transitions. [2019-05-15 10:39:32,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:32,612 INFO L225 Difference]: With dead ends: 92 [2019-05-15 10:39:32,612 INFO L226 Difference]: Without dead ends: 92 [2019-05-15 10:39:32,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2019-05-15 10:39:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-05-15 10:39:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-05-15 10:39:32,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:32,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:32,615 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:32,615 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:32,616 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:32,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:32,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:32,616 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:32,616 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2019-05-15 10:39:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:32,617 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-05-15 10:39:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:32,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:32,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:32,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:32,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:39:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-05-15 10:39:32,618 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-05-15 10:39:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:32,618 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-05-15 10:39:32,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-05-15 10:39:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-05-15 10:39:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-05-15 10:39:32,619 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:32,619 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-05-15 10:39:32,619 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:32,619 INFO L82 PathProgramCache]: Analyzing trace with hash -782518910, now seen corresponding path program 87 times [2019-05-15 10:39:32,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:32,668 WARN L254 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-15 10:39:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:32,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:32,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:39:32,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:32,752 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,752 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3835|]. (= (store |v_#memory_int_3835| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:32,753 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:32,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,772 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,772 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3836|]. (let ((.cse0 (select |v_#memory_int_3836| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3836| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0))) [2019-05-15 10:39:32,772 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:32,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,793 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3837|]. (let ((.cse0 (select |v_#memory_int_3837| ULTIMATE.start_main_p1))) (and (= .cse0 1) (= (store |v_#memory_int_3837| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:32,793 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:32,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,813 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3838|]. (let ((.cse0 (select |v_#memory_int_3838| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3838| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:39:32,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:32,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3839|]. (let ((.cse0 (select |v_#memory_int_3839| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_3839| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:32,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:32,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3840|]. (let ((.cse0 (select |v_#memory_int_3840| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3840| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 4 .cse0))) [2019-05-15 10:39:32,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:32,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,884 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3841|]. (let ((.cse0 (select |v_#memory_int_3841| ULTIMATE.start_main_p1))) (and (= 5 .cse0) (= (store |v_#memory_int_3841| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:32,884 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:32,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3842|]. (let ((.cse0 (select |v_#memory_int_3842| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_3842| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:32,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:32,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,934 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,935 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3843|]. (let ((.cse0 (select |v_#memory_int_3843| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3843| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 7 .cse0))) [2019-05-15 10:39:32,935 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:32,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,953 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,960 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3844|]. (let ((.cse0 (select |v_#memory_int_3844| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3844| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 8 .cse0))) [2019-05-15 10:39:32,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:32,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:32,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:32,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:32,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:32,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:32,987 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3845|]. (let ((.cse0 (select |v_#memory_int_3845| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= |#memory_int| (store |v_#memory_int_3845| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:32,987 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:33,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3846|]. (let ((.cse0 (select |v_#memory_int_3846| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3846| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 10))) [2019-05-15 10:39:33,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:33,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,060 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,060 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3847|]. (let ((.cse0 (select |v_#memory_int_3847| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3847| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,060 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:33,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3848|]. (let ((.cse0 (select |v_#memory_int_3848| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3848| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 12))) [2019-05-15 10:39:33,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:33,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,120 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,120 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3849|]. (let ((.cse0 (select |v_#memory_int_3849| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_3849| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,120 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:33,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,149 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,149 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3850|]. (let ((.cse0 (select |v_#memory_int_3850| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_3850| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,149 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:33,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3851|]. (let ((.cse0 (select |v_#memory_int_3851| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3851| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:39:33,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:33,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,208 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,208 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3852|]. (let ((.cse0 (select |v_#memory_int_3852| ULTIMATE.start_main_p1))) (and (= .cse0 16) (= |#memory_int| (store |v_#memory_int_3852| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:33,208 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:33,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,241 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3853|]. (let ((.cse0 (select |v_#memory_int_3853| ULTIMATE.start_main_p1))) (and (= .cse0 17) (= (store |v_#memory_int_3853| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,241 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:33,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3854|]. (let ((.cse0 (select |v_#memory_int_3854| ULTIMATE.start_main_p1))) (and (= .cse0 18) (= |#memory_int| (store |v_#memory_int_3854| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:33,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:33,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,309 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3855|]. (let ((.cse0 (select |v_#memory_int_3855| ULTIMATE.start_main_p1))) (and (= .cse0 19) (= |#memory_int| (store |v_#memory_int_3855| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:33,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:33,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,345 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,345 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3856|]. (let ((.cse0 (select |v_#memory_int_3856| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3856| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 20 .cse0))) [2019-05-15 10:39:33,346 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:33,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,381 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,381 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3857|]. (let ((.cse0 (select |v_#memory_int_3857| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3857| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 21))) [2019-05-15 10:39:33,381 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39:33,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3858|]. (let ((.cse0 (select |v_#memory_int_3858| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_3858| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:33,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,457 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,457 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3859|]. (let ((.cse0 (select |v_#memory_int_3859| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= |#memory_int| (store |v_#memory_int_3859| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:33,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:33,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3860|]. (let ((.cse0 (select |v_#memory_int_3860| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3860| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 24 .cse0))) [2019-05-15 10:39:33,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:33,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,534 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,534 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3861|]. (let ((.cse0 (select |v_#memory_int_3861| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3861| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 25 .cse0))) [2019-05-15 10:39:33,534 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:33,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3862|]. (let ((.cse0 (select |v_#memory_int_3862| ULTIMATE.start_main_p1))) (and (= 26 .cse0) (= |#memory_int| (store |v_#memory_int_3862| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:33,579 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:33,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3863|]. (let ((.cse0 (select |v_#memory_int_3863| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_3863| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,619 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:33,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,651 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,659 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,659 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3864|]. (let ((.cse0 (select |v_#memory_int_3864| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3864| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 28 .cse0))) [2019-05-15 10:39:33,659 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:33,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,700 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3865|]. (let ((.cse0 (select |v_#memory_int_3865| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3865| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:39:33,700 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:33,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3866|]. (let ((.cse0 (select |v_#memory_int_3866| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3866| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 30))) [2019-05-15 10:39:33,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:33,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3867|]. (let ((.cse0 (select |v_#memory_int_3867| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_3867| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:33,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:33,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,830 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,830 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3868|]. (let ((.cse0 (select |v_#memory_int_3868| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3868| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:39:33,830 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:33,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,876 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,876 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3869|]. (let ((.cse0 (select |v_#memory_int_3869| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3869| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 33 .cse0))) [2019-05-15 10:39:33,876 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:33,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,920 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,920 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3870|]. (let ((.cse0 (select |v_#memory_int_3870| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3870| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:39:33,920 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:33,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:33,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:33,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:33,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:33,967 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:33,967 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3871|]. (let ((.cse0 (select |v_#memory_int_3871| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3871| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:39:33,967 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:34,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,016 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,016 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3872|]. (let ((.cse0 (select |v_#memory_int_3872| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3872| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 36 .cse0))) [2019-05-15 10:39:34,016 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39:34,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,064 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,064 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3873|]. (let ((.cse0 (select |v_#memory_int_3873| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3873| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:39:34,064 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:34,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,115 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3874|]. (let ((.cse0 (select |v_#memory_int_3874| ULTIMATE.start_main_p1))) (and (= .cse0 38) (= (store |v_#memory_int_3874| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:34,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,168 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,169 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3875|]. (let ((.cse0 (select |v_#memory_int_3875| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3875| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 39))) [2019-05-15 10:39:34,169 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:34,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,223 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,224 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3876|]. (let ((.cse0 (select |v_#memory_int_3876| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3876| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:39:34,224 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:34,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3877|]. (let ((.cse0 (select |v_#memory_int_3877| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_3877| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:34,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,328 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,328 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3878|]. (let ((.cse0 (select |v_#memory_int_3878| ULTIMATE.start_main_p1))) (and (= .cse0 42) (= (store |v_#memory_int_3878| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,329 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:34,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,380 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,380 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3879|]. (let ((.cse0 (select |v_#memory_int_3879| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3879| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:39:34,380 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:34,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,433 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,433 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3880|]. (let ((.cse0 (select |v_#memory_int_3880| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_3880| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,434 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:34,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,489 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3881|]. (let ((.cse0 (select |v_#memory_int_3881| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3881| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 45 .cse0))) [2019-05-15 10:39:34,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:34,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,543 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3882|]. (let ((.cse0 (select |v_#memory_int_3882| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3882| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:39:34,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:34,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3883|]. (let ((.cse0 (select |v_#memory_int_3883| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_3883| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:34,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:34,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,658 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,658 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3884|]. (let ((.cse0 (select |v_#memory_int_3884| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_3884| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,658 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:34,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,717 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,717 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3885|]. (let ((.cse0 (select |v_#memory_int_3885| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3885| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 49))) [2019-05-15 10:39:34,718 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:34,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,776 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3886|]. (let ((.cse0 (select |v_#memory_int_3886| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3886| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 50))) [2019-05-15 10:39:34,776 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:34,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,834 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3887|]. (let ((.cse0 (select |v_#memory_int_3887| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3887| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:39:34,834 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:34,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,892 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,893 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3888|]. (let ((.cse0 (select |v_#memory_int_3888| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3888| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 52 .cse0))) [2019-05-15 10:39:34,893 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:34,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:34,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:34,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:34,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:34,953 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:34,953 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3889|]. (let ((.cse0 (select |v_#memory_int_3889| ULTIMATE.start_main_p1))) (and (= 53 .cse0) (= (store |v_#memory_int_3889| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:34,953 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:35,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3890|]. (let ((.cse0 (select |v_#memory_int_3890| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3890| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 54))) [2019-05-15 10:39:35,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:35,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,073 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,074 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3891|]. (let ((.cse0 (select |v_#memory_int_3891| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3891| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:39:35,074 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:35,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3892|]. (let ((.cse0 (select |v_#memory_int_3892| ULTIMATE.start_main_p1))) (and (= 56 .cse0) (= (store |v_#memory_int_3892| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:35,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:35,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,202 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,202 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3893|]. (let ((.cse0 (select |v_#memory_int_3893| ULTIMATE.start_main_p1))) (and (= .cse0 57) (= |#memory_int| (store |v_#memory_int_3893| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:35,202 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:35,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,266 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3894|]. (let ((.cse0 (select |v_#memory_int_3894| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3894| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:39:35,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39:35,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,335 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,335 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3895|]. (let ((.cse0 (select |v_#memory_int_3895| ULTIMATE.start_main_p1))) (and (= 59 .cse0) (= |#memory_int| (store |v_#memory_int_3895| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:35,335 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:35,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,394 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,402 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3896|]. (let ((.cse0 (select |v_#memory_int_3896| ULTIMATE.start_main_p1))) (and (= 60 .cse0) (= |#memory_int| (store |v_#memory_int_3896| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:35,403 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:35,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,477 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3897|]. (let ((.cse0 (select |v_#memory_int_3897| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3897| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:35,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:35,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3898|]. (let ((.cse0 (select |v_#memory_int_3898| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3898| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 62 .cse0))) [2019-05-15 10:39:35,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:35,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,607 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,607 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3899|]. (let ((.cse0 (select |v_#memory_int_3899| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_3899| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:35,607 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:35,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,676 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3900|]. (let ((.cse0 (select |v_#memory_int_3900| ULTIMATE.start_main_p1))) (and (= .cse0 64) (= |#memory_int| (store |v_#memory_int_3900| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:35,676 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:35,732 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,743 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,743 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3901|]. (let ((.cse0 (select |v_#memory_int_3901| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= |#memory_int| (store |v_#memory_int_3901| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:35,743 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39:35,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,812 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,812 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3902|]. (let ((.cse0 (select |v_#memory_int_3902| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_3902| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:35,812 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:35,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,882 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,882 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3903|]. (let ((.cse0 (select |v_#memory_int_3903| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3903| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 67))) [2019-05-15 10:39:35,882 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:35,947 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:35,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:35,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:35,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:35,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:35,959 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3904|]. (let ((.cse0 (select |v_#memory_int_3904| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3904| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:35,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:36,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,033 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,033 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3905|]. (let ((.cse0 (select |v_#memory_int_3905| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= |#memory_int| (store |v_#memory_int_3905| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:36,033 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:36,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,105 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,105 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3906|]. (let ((.cse0 (select |v_#memory_int_3906| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3906| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:39:36,105 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:36,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,171 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3907|]. (let ((.cse0 (select |v_#memory_int_3907| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3907| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 71))) [2019-05-15 10:39:36,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:36,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,251 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,251 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3908|]. (let ((.cse0 (select |v_#memory_int_3908| ULTIMATE.start_main_p1))) (and (= 72 .cse0) (= (store |v_#memory_int_3908| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:36,251 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:36,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,324 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3909|]. (let ((.cse0 (select |v_#memory_int_3909| ULTIMATE.start_main_p1))) (and (= 73 .cse0) (= (store |v_#memory_int_3909| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:36,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:36,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,398 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,398 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3910|]. (let ((.cse0 (select |v_#memory_int_3910| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3910| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:39:36,398 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:36,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,474 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,474 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3911|]. (let ((.cse0 (select |v_#memory_int_3911| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3911| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:39:36,474 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:36,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,551 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,551 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3912|]. (let ((.cse0 (select |v_#memory_int_3912| ULTIMATE.start_main_p1))) (and (= 76 .cse0) (= (store |v_#memory_int_3912| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:36,552 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:36,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,627 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3913|]. (let ((.cse0 (select |v_#memory_int_3913| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3913| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:39:36,627 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:36,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,706 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,706 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3914|]. (let ((.cse0 (select |v_#memory_int_3914| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_3914| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:36,706 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:36,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,785 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,785 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3915|]. (let ((.cse0 (select |v_#memory_int_3915| ULTIMATE.start_main_p1))) (and (= .cse0 79) (= |#memory_int| (store |v_#memory_int_3915| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:36,785 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:36,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,866 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,867 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3916|]. (let ((.cse0 (select |v_#memory_int_3916| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3916| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:39:36,867 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:36,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:36,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:36,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:36,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:36,949 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:36,949 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3917|]. (let ((.cse0 (select |v_#memory_int_3917| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_3917| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:36,949 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:37,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:37,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:37,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,023 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:37,031 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:37,031 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3918|]. (let ((.cse0 (select |v_#memory_int_3918| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3918| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:39:37,031 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39:37,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:37,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:37,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:37,117 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:37,117 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3919|]. (let ((.cse0 (select |v_#memory_int_3919| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3919| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 83))) [2019-05-15 10:39:37,117 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:37,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:37,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:37,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:37,198 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:37,198 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3920|]. (let ((.cse0 (select |v_#memory_int_3920| ULTIMATE.start_main_p1))) (and (= .cse0 84) (= (store |v_#memory_int_3920| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:37,198 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:37,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:37,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:37,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:37,286 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:37,287 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3921|]. (let ((.cse0 (select |v_#memory_int_3921| ULTIMATE.start_main_p1))) (and (= 85 .cse0) (= |#memory_int| (store |v_#memory_int_3921| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:37,287 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:39:37,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:37,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:37,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:37,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:37,369 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:37,369 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3922|]. (let ((.cse0 (select |v_#memory_int_3922| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3922| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 86 .cse0))) [2019-05-15 10:39:37,369 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:39:37,439 INFO L273 TraceCheckUtils]: 0: Hoare triple {33248#true} havoc main_p1; {33248#true} is VALID [2019-05-15 10:39:37,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {33248#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {33248#true} is VALID [2019-05-15 10:39:37,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {33248#true} #memory_int := #memory_int[main_p1 := 0]; {33259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:37,440 INFO L273 TraceCheckUtils]: 3: Hoare triple {33259#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:37,440 INFO L273 TraceCheckUtils]: 4: Hoare triple {33263#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:37,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {33267#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:37,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {33271#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:37,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {33275#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:37,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {33279#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:37,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {33283#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:37,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {33287#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:37,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {33291#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:37,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {33295#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:37,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {33299#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:37,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {33303#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:37,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {33307#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:37,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {33311#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:37,449 INFO L273 TraceCheckUtils]: 17: Hoare triple {33315#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:37,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {33319#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:37,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {33323#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:37,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {33327#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:37,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {33331#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:37,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {33335#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:37,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {33339#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:37,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {33343#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:37,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {33347#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:37,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {33351#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:37,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {33355#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:37,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {33359#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:37,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {33363#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:37,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {33367#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:37,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {33371#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:37,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {33375#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:37,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {33379#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:37,462 INFO L273 TraceCheckUtils]: 34: Hoare triple {33383#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:37,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {33387#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:37,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {33391#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:37,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {33395#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:37,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {33399#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:37,466 INFO L273 TraceCheckUtils]: 39: Hoare triple {33403#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:37,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {33407#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:37,467 INFO L273 TraceCheckUtils]: 41: Hoare triple {33411#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:37,468 INFO L273 TraceCheckUtils]: 42: Hoare triple {33415#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:37,469 INFO L273 TraceCheckUtils]: 43: Hoare triple {33419#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:37,469 INFO L273 TraceCheckUtils]: 44: Hoare triple {33423#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:37,470 INFO L273 TraceCheckUtils]: 45: Hoare triple {33427#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:37,471 INFO L273 TraceCheckUtils]: 46: Hoare triple {33431#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:37,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {33435#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:37,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {33439#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:37,473 INFO L273 TraceCheckUtils]: 49: Hoare triple {33443#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:37,474 INFO L273 TraceCheckUtils]: 50: Hoare triple {33447#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:37,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {33451#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:37,475 INFO L273 TraceCheckUtils]: 52: Hoare triple {33455#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:37,476 INFO L273 TraceCheckUtils]: 53: Hoare triple {33459#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:37,477 INFO L273 TraceCheckUtils]: 54: Hoare triple {33463#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:37,478 INFO L273 TraceCheckUtils]: 55: Hoare triple {33467#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:37,478 INFO L273 TraceCheckUtils]: 56: Hoare triple {33471#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:37,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {33475#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:37,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {33479#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:37,481 INFO L273 TraceCheckUtils]: 59: Hoare triple {33483#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:37,481 INFO L273 TraceCheckUtils]: 60: Hoare triple {33487#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:37,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {33491#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:37,483 INFO L273 TraceCheckUtils]: 62: Hoare triple {33495#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:37,484 INFO L273 TraceCheckUtils]: 63: Hoare triple {33499#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:37,484 INFO L273 TraceCheckUtils]: 64: Hoare triple {33503#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:37,485 INFO L273 TraceCheckUtils]: 65: Hoare triple {33507#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:37,486 INFO L273 TraceCheckUtils]: 66: Hoare triple {33511#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:37,487 INFO L273 TraceCheckUtils]: 67: Hoare triple {33515#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:37,487 INFO L273 TraceCheckUtils]: 68: Hoare triple {33519#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:37,488 INFO L273 TraceCheckUtils]: 69: Hoare triple {33523#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:37,489 INFO L273 TraceCheckUtils]: 70: Hoare triple {33527#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33531#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:37,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {33531#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33535#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:37,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {33535#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33539#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:37,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {33539#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33543#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:37,492 INFO L273 TraceCheckUtils]: 74: Hoare triple {33543#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33547#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:37,492 INFO L273 TraceCheckUtils]: 75: Hoare triple {33547#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33551#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:37,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {33551#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33555#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:37,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {33555#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33559#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:37,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {33559#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33563#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:37,495 INFO L273 TraceCheckUtils]: 79: Hoare triple {33563#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33567#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:37,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {33567#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33571#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:37,497 INFO L273 TraceCheckUtils]: 81: Hoare triple {33571#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33575#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:37,498 INFO L273 TraceCheckUtils]: 82: Hoare triple {33575#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33579#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:37,499 INFO L273 TraceCheckUtils]: 83: Hoare triple {33579#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33583#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:37,499 INFO L273 TraceCheckUtils]: 84: Hoare triple {33583#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33587#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:37,500 INFO L273 TraceCheckUtils]: 85: Hoare triple {33587#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33591#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:37,501 INFO L273 TraceCheckUtils]: 86: Hoare triple {33591#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33595#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:37,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {33595#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33599#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:37,502 INFO L273 TraceCheckUtils]: 88: Hoare triple {33599#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33603#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:39:37,503 INFO L273 TraceCheckUtils]: 89: Hoare triple {33603#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33607#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:39:37,504 INFO L273 TraceCheckUtils]: 90: Hoare triple {33607#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} assume !(#memory_int[main_p1] >= 0); {33249#false} is VALID [2019-05-15 10:39:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:37,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-15 10:39:37,515 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-05-15 10:39:37,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:37,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states. [2019-05-15 10:39:37,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-05-15 10:39:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-15 10:39:37,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:39:37,588 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 90 states. [2019-05-15 10:39:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:53,420 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:39:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-15 10:39:53,421 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 91 [2019-05-15 10:39:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:39:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:39:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:39:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-05-15 10:39:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2019-05-15 10:39:53,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2019-05-15 10:39:53,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:53,499 INFO L225 Difference]: With dead ends: 93 [2019-05-15 10:39:53,499 INFO L226 Difference]: Without dead ends: 93 [2019-05-15 10:39:53,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2019-05-15 10:39:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-05-15 10:39:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-05-15 10:39:53,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:39:53,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 93 states. [2019-05-15 10:39:53,501 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:39:53,501 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:39:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:53,502 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:39:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:39:53,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:53,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:53,503 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 93 states. [2019-05-15 10:39:53,503 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 93 states. [2019-05-15 10:39:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:39:53,504 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-05-15 10:39:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:39:53,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:39:53,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:39:53,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:39:53,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:39:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-05-15 10:39:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-05-15 10:39:53,506 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-05-15 10:39:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:39:53,506 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-05-15 10:39:53,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-05-15 10:39:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-05-15 10:39:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-05-15 10:39:53,507 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:39:53,507 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-05-15 10:39:53,507 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:39:53,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:39:53,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1511717512, now seen corresponding path program 88 times [2019-05-15 10:39:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:39:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:53,538 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-15 10:39:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:39:53,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:39:53,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:39:53,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:39:53,572 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,572 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3923|]. (= (store |v_#memory_int_3923| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:39:53,572 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:39:53,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,593 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3924|]. (let ((.cse0 (select |v_#memory_int_3924| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3924| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:39:53,593 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:39:53,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3925|]. (let ((.cse0 (select |v_#memory_int_3925| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= |#memory_int| (store |v_#memory_int_3925| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:53,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:39:53,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,639 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,639 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3926|]. (let ((.cse0 (select |v_#memory_int_3926| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3926| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:39:53,639 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:39:53,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,662 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,662 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3927|]. (let ((.cse0 (select |v_#memory_int_3927| ULTIMATE.start_main_p1))) (and (= .cse0 3) (= |#memory_int| (store |v_#memory_int_3927| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:53,662 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:39:53,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,686 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,686 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3928|]. (let ((.cse0 (select |v_#memory_int_3928| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= (store |v_#memory_int_3928| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:53,687 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:39:53,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3929|]. (let ((.cse0 (select |v_#memory_int_3929| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= |#memory_int| (store |v_#memory_int_3929| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:53,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:39:53,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,741 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,741 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3930|]. (let ((.cse0 (select |v_#memory_int_3930| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3930| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 6))) [2019-05-15 10:39:53,741 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:39:53,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3931|]. (let ((.cse0 (select |v_#memory_int_3931| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3931| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 7))) [2019-05-15 10:39:53,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:39:53,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,793 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,793 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3932|]. (let ((.cse0 (select |v_#memory_int_3932| ULTIMATE.start_main_p1))) (and (= .cse0 8) (= (store |v_#memory_int_3932| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:53,793 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:39:53,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3933|]. (let ((.cse0 (select |v_#memory_int_3933| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3933| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 9))) [2019-05-15 10:39:53,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:39:53,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3934|]. (let ((.cse0 (select |v_#memory_int_3934| ULTIMATE.start_main_p1))) (and (= .cse0 10) (= |#memory_int| (store |v_#memory_int_3934| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:53,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:39:53,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,873 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,873 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3935|]. (let ((.cse0 (select |v_#memory_int_3935| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_3935| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:53,874 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:39:53,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3936|]. (let ((.cse0 (select |v_#memory_int_3936| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3936| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:39:53,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:39:53,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,933 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,933 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3937|]. (let ((.cse0 (select |v_#memory_int_3937| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_3937| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:53,933 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:39:53,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3938|]. (let ((.cse0 (select |v_#memory_int_3938| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3938| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:39:53,964 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:39:53,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:53,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:53,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:53,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:53,994 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:53,994 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3939|]. (let ((.cse0 (select |v_#memory_int_3939| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= |#memory_int| (store |v_#memory_int_3939| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:53,994 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:39:54,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,025 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,026 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3940|]. (let ((.cse0 (select |v_#memory_int_3940| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3940| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 16))) [2019-05-15 10:39:54,026 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:39:54,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,058 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,058 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3941|]. (let ((.cse0 (select |v_#memory_int_3941| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3941| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:39:54,058 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:39:54,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3942|]. (let ((.cse0 (select |v_#memory_int_3942| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3942| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 18))) [2019-05-15 10:39:54,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:39:54,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,122 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,123 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3943|]. (let ((.cse0 (select |v_#memory_int_3943| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3943| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:39:54,123 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:39:54,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3944|]. (let ((.cse0 (select |v_#memory_int_3944| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3944| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 20))) [2019-05-15 10:39:54,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:39:54,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3945|]. (let ((.cse0 (select |v_#memory_int_3945| ULTIMATE.start_main_p1))) (and (= .cse0 21) (= (store |v_#memory_int_3945| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:39:54,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3946|]. (let ((.cse0 (select |v_#memory_int_3946| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3946| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 22))) [2019-05-15 10:39:54,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:39:54,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,268 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3947|]. (let ((.cse0 (select |v_#memory_int_3947| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3947| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 23 .cse0))) [2019-05-15 10:39:54,268 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:39:54,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,310 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,310 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3948|]. (let ((.cse0 (select |v_#memory_int_3948| ULTIMATE.start_main_p1))) (and (= .cse0 24) (= (store |v_#memory_int_3948| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,310 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:39:54,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,348 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,348 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3949|]. (let ((.cse0 (select |v_#memory_int_3949| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_3949| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,348 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:39:54,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,390 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,390 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3950|]. (let ((.cse0 (select |v_#memory_int_3950| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3950| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 26 .cse0))) [2019-05-15 10:39:54,390 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:39:54,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,422 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,429 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3951|]. (let ((.cse0 (select |v_#memory_int_3951| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3951| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 27 .cse0))) [2019-05-15 10:39:54,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:39:54,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,479 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3952|]. (let ((.cse0 (select |v_#memory_int_3952| ULTIMATE.start_main_p1))) (and (= 28 .cse0) (= (store |v_#memory_int_3952| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,479 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:39:54,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,521 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,521 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3953|]. (let ((.cse0 (select |v_#memory_int_3953| ULTIMATE.start_main_p1))) (and (= .cse0 29) (= |#memory_int| (store |v_#memory_int_3953| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:54,521 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:39:54,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3954|]. (let ((.cse0 (select |v_#memory_int_3954| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= (store |v_#memory_int_3954| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:39:54,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,610 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,610 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3955|]. (let ((.cse0 (select |v_#memory_int_3955| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3955| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:39:54,610 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:39:54,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,656 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,656 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3956|]. (let ((.cse0 (select |v_#memory_int_3956| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= |#memory_int| (store |v_#memory_int_3956| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:54,656 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:39:54,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,702 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,702 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3957|]. (let ((.cse0 (select |v_#memory_int_3957| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3957| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 33))) [2019-05-15 10:39:54,702 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:39:54,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,750 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3958|]. (let ((.cse0 (select |v_#memory_int_3958| ULTIMATE.start_main_p1))) (and (= 34 .cse0) (= (store |v_#memory_int_3958| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:39:54,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,795 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,795 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3959|]. (let ((.cse0 (select |v_#memory_int_3959| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3959| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 35 .cse0))) [2019-05-15 10:39:54,795 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:39:54,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,845 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,845 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3960|]. (let ((.cse0 (select |v_#memory_int_3960| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3960| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 36 .cse0))) [2019-05-15 10:39:54,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:39:54,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,892 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3961|]. (let ((.cse0 (select |v_#memory_int_3961| ULTIMATE.start_main_p1))) (and (= 37 .cse0) (= (store |v_#memory_int_3961| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:54,892 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:39:54,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,941 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,942 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3962|]. (let ((.cse0 (select |v_#memory_int_3962| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3962| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 38 .cse0))) [2019-05-15 10:39:54,942 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:39:54,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:54,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:54,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:54,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:54,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:54,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3963|]. (let ((.cse0 (select |v_#memory_int_3963| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_3963| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:54,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:39:55,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,036 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,036 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3964|]. (let ((.cse0 (select |v_#memory_int_3964| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3964| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 40 .cse0))) [2019-05-15 10:39:55,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:39:55,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,088 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3965|]. (let ((.cse0 (select |v_#memory_int_3965| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3965| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 41 .cse0))) [2019-05-15 10:39:55,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:39:55,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,140 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3966|]. (let ((.cse0 (select |v_#memory_int_3966| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3966| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 42))) [2019-05-15 10:39:55,140 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:39:55,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,194 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,194 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3967|]. (let ((.cse0 (select |v_#memory_int_3967| ULTIMATE.start_main_p1))) (and (= 43 .cse0) (= (store |v_#memory_int_3967| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,194 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:39:55,236 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,248 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,248 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3968|]. (let ((.cse0 (select |v_#memory_int_3968| ULTIMATE.start_main_p1))) (and (= 44 .cse0) (= (store |v_#memory_int_3968| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,248 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:39:55,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,303 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,303 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3969|]. (let ((.cse0 (select |v_#memory_int_3969| ULTIMATE.start_main_p1))) (and (= 45 .cse0) (= (store |v_#memory_int_3969| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,303 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:39:55,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3970|]. (let ((.cse0 (select |v_#memory_int_3970| ULTIMATE.start_main_p1))) (and (= .cse0 46) (= |#memory_int| (store |v_#memory_int_3970| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:55,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:39:55,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,422 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,423 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3971|]. (let ((.cse0 (select |v_#memory_int_3971| ULTIMATE.start_main_p1))) (and (= .cse0 47) (= |#memory_int| (store |v_#memory_int_3971| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:55,423 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:39:55,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,482 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,482 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3972|]. (let ((.cse0 (select |v_#memory_int_3972| ULTIMATE.start_main_p1))) (and (= .cse0 48) (= (store |v_#memory_int_3972| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,482 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:39:55,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3973|]. (let ((.cse0 (select |v_#memory_int_3973| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_3973| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:39:55,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,597 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,597 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3974|]. (let ((.cse0 (select |v_#memory_int_3974| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3974| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 50 .cse0))) [2019-05-15 10:39:55,597 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:39:55,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3975|]. (let ((.cse0 (select |v_#memory_int_3975| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3975| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 51))) [2019-05-15 10:39:55,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:39:55,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,715 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,716 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3976|]. (let ((.cse0 (select |v_#memory_int_3976| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_3976| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:55,716 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:39:55,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3977|]. (let ((.cse0 (select |v_#memory_int_3977| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3977| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 53 .cse0))) [2019-05-15 10:39:55,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:39:55,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,833 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,833 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3978|]. (let ((.cse0 (select |v_#memory_int_3978| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3978| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:39:55,833 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:39:55,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,903 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3979|]. (let ((.cse0 (select |v_#memory_int_3979| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3979| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 55))) [2019-05-15 10:39:55,903 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:39:55,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:55,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:55,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:55,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:55,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:55,964 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3980|]. (let ((.cse0 (select |v_#memory_int_3980| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3980| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 56))) [2019-05-15 10:39:55,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:39:56,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,024 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,024 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3981|]. (let ((.cse0 (select |v_#memory_int_3981| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_3981| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,024 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:39:56,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3982|]. (let ((.cse0 (select |v_#memory_int_3982| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3982| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 58))) [2019-05-15 10:39:56,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:39:56,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3983|]. (let ((.cse0 (select |v_#memory_int_3983| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_3983| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:39:56,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,216 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,216 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3984|]. (let ((.cse0 (select |v_#memory_int_3984| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3984| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 60))) [2019-05-15 10:39:56,216 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:39:56,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,274 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,285 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,285 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3985|]. (let ((.cse0 (select |v_#memory_int_3985| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= (store |v_#memory_int_3985| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,286 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:39:56,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,351 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,351 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3986|]. (let ((.cse0 (select |v_#memory_int_3986| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3986| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 62))) [2019-05-15 10:39:56,352 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:39:56,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,420 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,421 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3987|]. (let ((.cse0 (select |v_#memory_int_3987| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_3987| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,421 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:39:56,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,488 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,489 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3988|]. (let ((.cse0 (select |v_#memory_int_3988| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3988| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:39:56,489 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:39:56,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,554 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,555 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3989|]. (let ((.cse0 (select |v_#memory_int_3989| ULTIMATE.start_main_p1))) (and (= .cse0 65) (= |#memory_int| (store |v_#memory_int_3989| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:56,555 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:39:56,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,625 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,625 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3990|]. (let ((.cse0 (select |v_#memory_int_3990| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= |#memory_int| (store |v_#memory_int_3990| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:39:56,625 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:39:56,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,693 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,694 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3991|]. (let ((.cse0 (select |v_#memory_int_3991| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= (store |v_#memory_int_3991| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,694 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:39:56,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,766 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,766 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3992|]. (let ((.cse0 (select |v_#memory_int_3992| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= (store |v_#memory_int_3992| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,767 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:39:56,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,836 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,836 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3993|]. (let ((.cse0 (select |v_#memory_int_3993| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3993| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 69 .cse0))) [2019-05-15 10:39:56,836 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:39:56,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3994|]. (let ((.cse0 (select |v_#memory_int_3994| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3994| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 70))) [2019-05-15 10:39:56,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:39:56,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:56,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:56,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:56,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:56,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:56,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3995|]. (let ((.cse0 (select |v_#memory_int_3995| ULTIMATE.start_main_p1))) (and (= .cse0 71) (= (store |v_#memory_int_3995| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:56,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:39:57,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,062 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,062 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3996|]. (let ((.cse0 (select |v_#memory_int_3996| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3996| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 72))) [2019-05-15 10:39:57,062 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:39:57,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,140 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,141 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3997|]. (let ((.cse0 (select |v_#memory_int_3997| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3997| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:39:57,141 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:39:57,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,215 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,215 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3998|]. (let ((.cse0 (select |v_#memory_int_3998| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_3998| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 74 .cse0))) [2019-05-15 10:39:57,215 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:39:57,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,288 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,288 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_3999|]. (let ((.cse0 (select |v_#memory_int_3999| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_3999| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 75 .cse0))) [2019-05-15 10:39:57,288 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:39:57,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,364 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,364 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4000|]. (let ((.cse0 (select |v_#memory_int_4000| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4000| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 76))) [2019-05-15 10:39:57,364 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:39:57,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,442 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,442 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4001|]. (let ((.cse0 (select |v_#memory_int_4001| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4001| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 77 .cse0))) [2019-05-15 10:39:57,442 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:39:57,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,515 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,523 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,523 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4002|]. (let ((.cse0 (select |v_#memory_int_4002| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4002| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 78 .cse0))) [2019-05-15 10:39:57,523 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:39:57,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,604 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,604 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4003|]. (let ((.cse0 (select |v_#memory_int_4003| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4003| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:39:57,604 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:39:57,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,683 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,683 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4004|]. (let ((.cse0 (select |v_#memory_int_4004| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4004| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:39:57,683 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:39:57,752 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,763 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,763 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4005|]. (let ((.cse0 (select |v_#memory_int_4005| ULTIMATE.start_main_p1))) (and (= 81 .cse0) (= (store |v_#memory_int_4005| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:57,763 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:39:57,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,843 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4006|]. (let ((.cse0 (select |v_#memory_int_4006| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4006| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 82 .cse0))) [2019-05-15 10:39:57,844 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:39:57,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:57,915 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:57,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:57,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:57,924 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:57,925 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4007|]. (let ((.cse0 (select |v_#memory_int_4007| ULTIMATE.start_main_p1))) (and (= .cse0 83) (= (store |v_#memory_int_4007| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:57,925 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:39:58,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:58,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:58,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4008|]. (let ((.cse0 (select |v_#memory_int_4008| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4008| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 84 .cse0))) [2019-05-15 10:39:58,013 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:39:58,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:58,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:58,098 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,098 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4009|]. (let ((.cse0 (select |v_#memory_int_4009| ULTIMATE.start_main_p1))) (and (= .cse0 85) (= (store |v_#memory_int_4009| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:39:58,098 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:39:58,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:58,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:58,184 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,184 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4010|]. (let ((.cse0 (select |v_#memory_int_4010| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4010| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 86))) [2019-05-15 10:39:58,184 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:39:58,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:39:58,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:39:58,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:39:58,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:39:58,275 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:39:58,275 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4011|]. (let ((.cse0 (select |v_#memory_int_4011| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4011| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 87))) [2019-05-15 10:39:58,275 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:39:58,349 INFO L273 TraceCheckUtils]: 0: Hoare triple {33982#true} havoc main_p1; {33982#true} is VALID [2019-05-15 10:39:58,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {33982#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {33982#true} is VALID [2019-05-15 10:39:58,350 INFO L273 TraceCheckUtils]: 2: Hoare triple {33982#true} #memory_int := #memory_int[main_p1 := 0]; {33993#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:39:58,350 INFO L273 TraceCheckUtils]: 3: Hoare triple {33993#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {33997#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:39:58,351 INFO L273 TraceCheckUtils]: 4: Hoare triple {33997#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34001#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:39:58,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {34001#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34005#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:39:58,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {34005#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34009#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:39:58,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {34009#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34013#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:39:58,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {34013#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34017#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:39:58,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {34017#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34021#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:39:58,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {34021#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34025#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:39:58,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {34025#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34029#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:39:58,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {34029#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34033#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:39:58,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {34033#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34037#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:39:58,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {34037#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34041#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:39:58,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {34041#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34045#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:39:58,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {34045#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34049#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:39:58,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {34049#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34053#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:39:58,363 INFO L273 TraceCheckUtils]: 18: Hoare triple {34053#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34057#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:39:58,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {34057#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34061#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:39:58,364 INFO L273 TraceCheckUtils]: 20: Hoare triple {34061#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34065#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:39:58,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {34065#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34069#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:39:58,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {34069#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34073#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:39:58,366 INFO L273 TraceCheckUtils]: 23: Hoare triple {34073#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34077#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:39:58,367 INFO L273 TraceCheckUtils]: 24: Hoare triple {34077#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34081#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:39:58,368 INFO L273 TraceCheckUtils]: 25: Hoare triple {34081#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34085#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:39:58,369 INFO L273 TraceCheckUtils]: 26: Hoare triple {34085#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34089#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:39:58,369 INFO L273 TraceCheckUtils]: 27: Hoare triple {34089#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34093#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:39:58,370 INFO L273 TraceCheckUtils]: 28: Hoare triple {34093#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34097#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:39:58,371 INFO L273 TraceCheckUtils]: 29: Hoare triple {34097#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34101#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:39:58,372 INFO L273 TraceCheckUtils]: 30: Hoare triple {34101#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34105#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:39:58,372 INFO L273 TraceCheckUtils]: 31: Hoare triple {34105#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34109#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:39:58,373 INFO L273 TraceCheckUtils]: 32: Hoare triple {34109#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34113#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:39:58,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {34113#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34117#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:39:58,375 INFO L273 TraceCheckUtils]: 34: Hoare triple {34117#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34121#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:39:58,375 INFO L273 TraceCheckUtils]: 35: Hoare triple {34121#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34125#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:39:58,376 INFO L273 TraceCheckUtils]: 36: Hoare triple {34125#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34129#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:39:58,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {34129#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34133#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:39:58,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {34133#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34137#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:39:58,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {34137#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34141#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:39:58,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {34141#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34145#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:39:58,380 INFO L273 TraceCheckUtils]: 41: Hoare triple {34145#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34149#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:39:58,380 INFO L273 TraceCheckUtils]: 42: Hoare triple {34149#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34153#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:39:58,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {34153#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34157#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:39:58,382 INFO L273 TraceCheckUtils]: 44: Hoare triple {34157#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34161#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:39:58,383 INFO L273 TraceCheckUtils]: 45: Hoare triple {34161#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34165#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:39:58,383 INFO L273 TraceCheckUtils]: 46: Hoare triple {34165#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34169#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:39:58,384 INFO L273 TraceCheckUtils]: 47: Hoare triple {34169#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34173#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:39:58,385 INFO L273 TraceCheckUtils]: 48: Hoare triple {34173#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34177#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:39:58,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {34177#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34181#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:39:58,386 INFO L273 TraceCheckUtils]: 50: Hoare triple {34181#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34185#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:39:58,387 INFO L273 TraceCheckUtils]: 51: Hoare triple {34185#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34189#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:39:58,388 INFO L273 TraceCheckUtils]: 52: Hoare triple {34189#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34193#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:39:58,389 INFO L273 TraceCheckUtils]: 53: Hoare triple {34193#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34197#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:39:58,389 INFO L273 TraceCheckUtils]: 54: Hoare triple {34197#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34201#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:39:58,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {34201#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34205#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:39:58,391 INFO L273 TraceCheckUtils]: 56: Hoare triple {34205#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34209#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:39:58,392 INFO L273 TraceCheckUtils]: 57: Hoare triple {34209#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34213#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:39:58,392 INFO L273 TraceCheckUtils]: 58: Hoare triple {34213#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34217#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:39:58,393 INFO L273 TraceCheckUtils]: 59: Hoare triple {34217#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34221#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:39:58,394 INFO L273 TraceCheckUtils]: 60: Hoare triple {34221#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34225#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:39:58,395 INFO L273 TraceCheckUtils]: 61: Hoare triple {34225#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34229#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:39:58,395 INFO L273 TraceCheckUtils]: 62: Hoare triple {34229#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34233#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:39:58,396 INFO L273 TraceCheckUtils]: 63: Hoare triple {34233#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34237#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:39:58,397 INFO L273 TraceCheckUtils]: 64: Hoare triple {34237#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34241#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:39:58,398 INFO L273 TraceCheckUtils]: 65: Hoare triple {34241#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34245#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:39:58,398 INFO L273 TraceCheckUtils]: 66: Hoare triple {34245#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34249#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:39:58,399 INFO L273 TraceCheckUtils]: 67: Hoare triple {34249#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34253#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:39:58,400 INFO L273 TraceCheckUtils]: 68: Hoare triple {34253#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34257#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:39:58,401 INFO L273 TraceCheckUtils]: 69: Hoare triple {34257#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34261#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:39:58,401 INFO L273 TraceCheckUtils]: 70: Hoare triple {34261#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34265#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:39:58,402 INFO L273 TraceCheckUtils]: 71: Hoare triple {34265#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34269#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:39:58,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {34269#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34273#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:39:58,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {34273#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34277#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:39:58,404 INFO L273 TraceCheckUtils]: 74: Hoare triple {34277#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34281#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:39:58,405 INFO L273 TraceCheckUtils]: 75: Hoare triple {34281#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34285#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:39:58,406 INFO L273 TraceCheckUtils]: 76: Hoare triple {34285#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34289#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:39:58,406 INFO L273 TraceCheckUtils]: 77: Hoare triple {34289#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34293#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:39:58,407 INFO L273 TraceCheckUtils]: 78: Hoare triple {34293#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34297#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:39:58,408 INFO L273 TraceCheckUtils]: 79: Hoare triple {34297#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34301#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:39:58,409 INFO L273 TraceCheckUtils]: 80: Hoare triple {34301#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34305#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:39:58,409 INFO L273 TraceCheckUtils]: 81: Hoare triple {34305#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34309#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:39:58,410 INFO L273 TraceCheckUtils]: 82: Hoare triple {34309#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34313#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:39:58,411 INFO L273 TraceCheckUtils]: 83: Hoare triple {34313#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34317#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:39:58,412 INFO L273 TraceCheckUtils]: 84: Hoare triple {34317#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34321#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:39:58,412 INFO L273 TraceCheckUtils]: 85: Hoare triple {34321#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34325#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:39:58,413 INFO L273 TraceCheckUtils]: 86: Hoare triple {34325#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34329#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:39:58,414 INFO L273 TraceCheckUtils]: 87: Hoare triple {34329#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34333#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:39:58,415 INFO L273 TraceCheckUtils]: 88: Hoare triple {34333#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34337#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:39:58,415 INFO L273 TraceCheckUtils]: 89: Hoare triple {34337#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34341#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:39:58,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {34341#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34345#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:39:58,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {34345#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} assume !(#memory_int[main_p1] >= 0); {33983#false} is VALID [2019-05-15 10:39:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:39:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:39:58,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-15 10:39:58,427 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-05-15 10:39:58,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:39:58,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states. [2019-05-15 10:39:58,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:39:58,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-05-15 10:39:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-15 10:39:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2019-05-15 10:39:58,505 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 91 states. [2019-05-15 10:40:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:14,800 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:14,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-15 10:40:14,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 92 [2019-05-15 10:40:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:40:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-05-15 10:40:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-05-15 10:40:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-05-15 10:40:14,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 95 transitions. [2019-05-15 10:40:14,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:14,878 INFO L225 Difference]: With dead ends: 94 [2019-05-15 10:40:14,878 INFO L226 Difference]: Without dead ends: 94 [2019-05-15 10:40:14,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2019-05-15 10:40:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-05-15 10:40:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-05-15 10:40:14,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:14,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:14,880 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:14,880 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:14,881 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:14,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:14,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:14,882 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:14,882 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 94 states. [2019-05-15 10:40:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:14,882 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-05-15 10:40:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:14,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:14,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:14,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:14,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-05-15 10:40:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-05-15 10:40:14,884 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-05-15 10:40:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:14,884 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-05-15 10:40:14,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-05-15 10:40:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-05-15 10:40:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-05-15 10:40:14,884 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:14,884 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-05-15 10:40:14,885 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash -381397438, now seen corresponding path program 89 times [2019-05-15 10:40:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:14,926 WARN L254 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-15 10:40:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:14,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:14,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:40:14,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:14,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:14,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:14,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:14,964 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:14,965 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4012|]. (= |#memory_int| (store |v_#memory_int_4012| ULTIMATE.start_main_p1 0)) [2019-05-15 10:40:14,965 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:14,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:14,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:14,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:14,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:14,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:14,990 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:14,990 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4013|]. (let ((.cse0 (select |v_#memory_int_4013| ULTIMATE.start_main_p1))) (and (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_4013| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:14,990 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:15,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,010 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,010 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4014|]. (let ((.cse0 (select |v_#memory_int_4014| ULTIMATE.start_main_p1))) (and (= 1 .cse0) (= (store |v_#memory_int_4014| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,010 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:15,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4015|]. (let ((.cse0 (select |v_#memory_int_4015| ULTIMATE.start_main_p1))) (and (= 2 .cse0) (= |#memory_int| (store |v_#memory_int_4015| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:15,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:15,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,053 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,054 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4016|]. (let ((.cse0 (select |v_#memory_int_4016| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4016| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:40:15,054 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:15,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4017|]. (let ((.cse0 (select |v_#memory_int_4017| ULTIMATE.start_main_p1))) (and (= 4 .cse0) (= (store |v_#memory_int_4017| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:15,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,100 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,100 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4018|]. (let ((.cse0 (select |v_#memory_int_4018| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4018| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 5 .cse0))) [2019-05-15 10:40:15,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:15,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,124 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,124 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4019|]. (let ((.cse0 (select |v_#memory_int_4019| ULTIMATE.start_main_p1))) (and (= .cse0 6) (= (store |v_#memory_int_4019| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,124 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:15,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,142 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,150 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,150 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4020|]. (let ((.cse0 (select |v_#memory_int_4020| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_4020| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:15,150 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:15,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,175 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,176 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4021|]. (let ((.cse0 (select |v_#memory_int_4021| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4021| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:40:15,176 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:15,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,200 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,200 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4022|]. (let ((.cse0 (select |v_#memory_int_4022| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4022| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:40:15,201 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:15,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,226 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,226 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4023|]. (let ((.cse0 (select |v_#memory_int_4023| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4023| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 10 .cse0))) [2019-05-15 10:40:15,227 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:15,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,256 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,256 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4024|]. (let ((.cse0 (select |v_#memory_int_4024| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4024| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 11))) [2019-05-15 10:40:15,256 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:15,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,284 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,284 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4025|]. (let ((.cse0 (select |v_#memory_int_4025| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4025| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 12 .cse0))) [2019-05-15 10:40:15,284 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:15,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,318 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,318 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4026|]. (let ((.cse0 (select |v_#memory_int_4026| ULTIMATE.start_main_p1))) (and (= 13 .cse0) (= |#memory_int| (store |v_#memory_int_4026| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:15,318 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:15,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,349 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,349 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4027|]. (let ((.cse0 (select |v_#memory_int_4027| ULTIMATE.start_main_p1))) (and (= .cse0 14) (= (store |v_#memory_int_4027| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,349 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:15,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,383 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,383 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4028|]. (let ((.cse0 (select |v_#memory_int_4028| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_4028| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,383 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:15,405 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,414 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,414 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4029|]. (let ((.cse0 (select |v_#memory_int_4029| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4029| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:40:15,414 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:15,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4030|]. (let ((.cse0 (select |v_#memory_int_4030| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4030| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:40:15,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:15,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,477 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,478 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4031|]. (let ((.cse0 (select |v_#memory_int_4031| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4031| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 18 .cse0))) [2019-05-15 10:40:15,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:15,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,510 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,511 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4032|]. (let ((.cse0 (select |v_#memory_int_4032| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4032| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 19))) [2019-05-15 10:40:15,511 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:15,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,542 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,543 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4033|]. (let ((.cse0 (select |v_#memory_int_4033| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_4033| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,543 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:15,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4034|]. (let ((.cse0 (select |v_#memory_int_4034| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4034| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:40:15,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:15,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,618 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,618 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4035|]. (let ((.cse0 (select |v_#memory_int_4035| ULTIMATE.start_main_p1))) (and (= .cse0 22) (= (store |v_#memory_int_4035| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,618 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:15,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,657 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,657 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4036|]. (let ((.cse0 (select |v_#memory_int_4036| ULTIMATE.start_main_p1))) (and (= .cse0 23) (= (store |v_#memory_int_4036| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,657 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:15,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,695 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,696 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4037|]. (let ((.cse0 (select |v_#memory_int_4037| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4037| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 24))) [2019-05-15 10:40:15,696 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:15,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,735 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4038|]. (let ((.cse0 (select |v_#memory_int_4038| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_4038| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:15,736 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:15,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,768 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,775 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,775 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4039|]. (let ((.cse0 (select |v_#memory_int_4039| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4039| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 26))) [2019-05-15 10:40:15,775 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:15,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,815 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4040|]. (let ((.cse0 (select |v_#memory_int_4040| ULTIMATE.start_main_p1))) (and (= .cse0 27) (= (store |v_#memory_int_4040| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,815 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:15,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,855 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,855 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4041|]. (let ((.cse0 (select |v_#memory_int_4041| ULTIMATE.start_main_p1))) (and (= .cse0 28) (= (store |v_#memory_int_4041| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,855 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:15,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,901 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4042|]. (let ((.cse0 (select |v_#memory_int_4042| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_4042| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:15,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,944 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,944 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4043|]. (let ((.cse0 (select |v_#memory_int_4043| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= |#memory_int| (store |v_#memory_int_4043| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:15,944 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:15,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:15,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:15,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:15,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:15,989 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:15,989 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4044|]. (let ((.cse0 (select |v_#memory_int_4044| ULTIMATE.start_main_p1))) (and (= .cse0 31) (= (store |v_#memory_int_4044| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:15,989 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:16,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,032 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,032 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4045|]. (let ((.cse0 (select |v_#memory_int_4045| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= (store |v_#memory_int_4045| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,032 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:40:16,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,076 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,076 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4046|]. (let ((.cse0 (select |v_#memory_int_4046| ULTIMATE.start_main_p1))) (and (= 33 .cse0) (= (store |v_#memory_int_4046| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,076 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:40:16,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,118 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,118 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4047|]. (let ((.cse0 (select |v_#memory_int_4047| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4047| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 34 .cse0))) [2019-05-15 10:40:16,118 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:40:16,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4048|]. (let ((.cse0 (select |v_#memory_int_4048| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4048| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:40:16,164 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:40:16,199 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,210 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4049|]. (let ((.cse0 (select |v_#memory_int_4049| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4049| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:40:16,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:40:16,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,257 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,257 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4050|]. (let ((.cse0 (select |v_#memory_int_4050| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4050| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 37 .cse0))) [2019-05-15 10:40:16,257 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:40:16,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,304 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4051|]. (let ((.cse0 (select |v_#memory_int_4051| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4051| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:40:16,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:40:16,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,354 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,354 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4052|]. (let ((.cse0 (select |v_#memory_int_4052| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4052| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:40:16,354 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:40:16,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,403 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,403 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4053|]. (let ((.cse0 (select |v_#memory_int_4053| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4053| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 40))) [2019-05-15 10:40:16,404 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:40:16,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,461 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4054|]. (let ((.cse0 (select |v_#memory_int_4054| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4054| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 41 .cse0))) [2019-05-15 10:40:16,461 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:40:16,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,513 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4055|]. (let ((.cse0 (select |v_#memory_int_4055| ULTIMATE.start_main_p1))) (and (= 42 .cse0) (= (store |v_#memory_int_4055| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:40:16,553 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,557 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,564 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,565 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4056|]. (let ((.cse0 (select |v_#memory_int_4056| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4056| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:40:16,565 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:40:16,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4057|]. (let ((.cse0 (select |v_#memory_int_4057| ULTIMATE.start_main_p1))) (and (= .cse0 44) (= (store |v_#memory_int_4057| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:40:16,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,667 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4058|]. (let ((.cse0 (select |v_#memory_int_4058| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4058| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 45 .cse0))) [2019-05-15 10:40:16,667 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:40:16,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,724 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,724 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4059|]. (let ((.cse0 (select |v_#memory_int_4059| ULTIMATE.start_main_p1))) (and (= 46 .cse0) (= (store |v_#memory_int_4059| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,724 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:40:16,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,780 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,780 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4060|]. (let ((.cse0 (select |v_#memory_int_4060| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4060| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:40:16,780 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:40:16,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,835 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,835 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4061|]. (let ((.cse0 (select |v_#memory_int_4061| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4061| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:40:16,835 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:40:16,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4062|]. (let ((.cse0 (select |v_#memory_int_4062| ULTIMATE.start_main_p1))) (and (= 49 .cse0) (= |#memory_int| (store |v_#memory_int_4062| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:16,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:40:16,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:16,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:16,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:16,947 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:16,947 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4063|]. (let ((.cse0 (select |v_#memory_int_4063| ULTIMATE.start_main_p1))) (and (= .cse0 50) (= (store |v_#memory_int_4063| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:16,947 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:40:16,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:16,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4064|]. (let ((.cse0 (select |v_#memory_int_4064| ULTIMATE.start_main_p1))) (and (= .cse0 51) (= (store |v_#memory_int_4064| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,009 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:40:17,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,067 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,068 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4065|]. (let ((.cse0 (select |v_#memory_int_4065| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= (store |v_#memory_int_4065| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,068 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:40:17,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4066|]. (let ((.cse0 (select |v_#memory_int_4066| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= (store |v_#memory_int_4066| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:40:17,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,177 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,185 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,186 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4067|]. (let ((.cse0 (select |v_#memory_int_4067| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4067| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 54))) [2019-05-15 10:40:17,186 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:40:17,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4068|]. (let ((.cse0 (select |v_#memory_int_4068| ULTIMATE.start_main_p1))) (and (= .cse0 55) (= (store |v_#memory_int_4068| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,247 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:40:17,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,308 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,308 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4069|]. (let ((.cse0 (select |v_#memory_int_4069| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4069| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 56 .cse0))) [2019-05-15 10:40:17,308 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:40:17,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,372 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,372 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4070|]. (let ((.cse0 (select |v_#memory_int_4070| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_4070| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,372 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:40:17,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,435 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,435 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4071|]. (let ((.cse0 (select |v_#memory_int_4071| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4071| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 58))) [2019-05-15 10:40:17,435 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:40:17,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,501 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,501 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4072|]. (let ((.cse0 (select |v_#memory_int_4072| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_4072| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,501 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:40:17,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,566 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,566 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4073|]. (let ((.cse0 (select |v_#memory_int_4073| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4073| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:40:17,566 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:40:17,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4074|]. (let ((.cse0 (select |v_#memory_int_4074| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4074| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 61 .cse0))) [2019-05-15 10:40:17,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:40:17,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,700 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,701 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4075|]. (let ((.cse0 (select |v_#memory_int_4075| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= (store |v_#memory_int_4075| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,701 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:40:17,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4076|]. (let ((.cse0 (select |v_#memory_int_4076| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4076| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 63))) [2019-05-15 10:40:17,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:40:17,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,832 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,832 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4077|]. (let ((.cse0 (select |v_#memory_int_4077| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4077| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 64))) [2019-05-15 10:40:17,832 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:40:17,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,900 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,901 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4078|]. (let ((.cse0 (select |v_#memory_int_4078| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4078| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 65))) [2019-05-15 10:40:17,901 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:40:17,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:17,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:17,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:17,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:17,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:17,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4079|]. (let ((.cse0 (select |v_#memory_int_4079| ULTIMATE.start_main_p1))) (and (= .cse0 66) (= (store |v_#memory_int_4079| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:17,969 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:40:18,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4080|]. (let ((.cse0 (select |v_#memory_int_4080| ULTIMATE.start_main_p1))) (and (= 67 .cse0) (= (store |v_#memory_int_4080| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,036 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:40:18,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,104 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,104 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4081|]. (let ((.cse0 (select |v_#memory_int_4081| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4081| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 68))) [2019-05-15 10:40:18,104 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:40:18,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,179 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4082|]. (let ((.cse0 (select |v_#memory_int_4082| ULTIMATE.start_main_p1))) (and (= .cse0 69) (= (store |v_#memory_int_4082| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,179 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:40:18,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,250 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,250 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4083|]. (let ((.cse0 (select |v_#memory_int_4083| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_4083| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,250 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:40:18,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,321 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,321 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4084|]. (let ((.cse0 (select |v_#memory_int_4084| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= |#memory_int| (store |v_#memory_int_4084| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:18,321 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:40:18,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,391 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,392 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4085|]. (let ((.cse0 (select |v_#memory_int_4085| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4085| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 72 .cse0))) [2019-05-15 10:40:18,392 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:40:18,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,464 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,465 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4086|]. (let ((.cse0 (select |v_#memory_int_4086| ULTIMATE.start_main_p1))) (and (= .cse0 73) (= (store |v_#memory_int_4086| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,465 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:40:18,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,541 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,541 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4087|]. (let ((.cse0 (select |v_#memory_int_4087| ULTIMATE.start_main_p1))) (and (= .cse0 74) (= (store |v_#memory_int_4087| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,541 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:40:18,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,615 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,615 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4088|]. (let ((.cse0 (select |v_#memory_int_4088| ULTIMATE.start_main_p1))) (and (= 75 .cse0) (= |#memory_int| (store |v_#memory_int_4088| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:18,615 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:40:18,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,690 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,690 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4089|]. (let ((.cse0 (select |v_#memory_int_4089| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_4089| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:40:18,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,767 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,767 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4090|]. (let ((.cse0 (select |v_#memory_int_4090| ULTIMATE.start_main_p1))) (and (= .cse0 77) (= (store |v_#memory_int_4090| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,768 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:40:18,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,853 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,853 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4091|]. (let ((.cse0 (select |v_#memory_int_4091| ULTIMATE.start_main_p1))) (and (= .cse0 78) (= (store |v_#memory_int_4091| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:18,853 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:40:18,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:18,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:18,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:18,929 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:18,929 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4092|]. (let ((.cse0 (select |v_#memory_int_4092| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4092| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 79 .cse0))) [2019-05-15 10:40:18,929 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:40:18,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:18,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,008 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,008 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4093|]. (let ((.cse0 (select |v_#memory_int_4093| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4093| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:40:19,008 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:40:19,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,087 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,087 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4094|]. (let ((.cse0 (select |v_#memory_int_4094| ULTIMATE.start_main_p1))) (and (= .cse0 81) (= (store |v_#memory_int_4094| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:19,087 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:40:19,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,157 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,163 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4095|]. (let ((.cse0 (select |v_#memory_int_4095| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4095| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 82))) [2019-05-15 10:40:19,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:40:19,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,238 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,246 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,246 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4096|]. (let ((.cse0 (select |v_#memory_int_4096| ULTIMATE.start_main_p1))) (and (= 83 .cse0) (= (store |v_#memory_int_4096| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:19,246 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:40:19,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,324 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,324 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,332 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,332 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4097|]. (let ((.cse0 (select |v_#memory_int_4097| ULTIMATE.start_main_p1))) (and (= 84 .cse0) (= |#memory_int| (store |v_#memory_int_4097| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:19,332 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:40:19,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4098|]. (let ((.cse0 (select |v_#memory_int_4098| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4098| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 85 .cse0))) [2019-05-15 10:40:19,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:40:19,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,508 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,508 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4099|]. (let ((.cse0 (select |v_#memory_int_4099| ULTIMATE.start_main_p1))) (and (= 86 .cse0) (= (store |v_#memory_int_4099| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:19,509 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:40:19,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,593 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,594 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4100|]. (let ((.cse0 (select |v_#memory_int_4100| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4100| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 87))) [2019-05-15 10:40:19,594 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:40:19,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:19,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:19,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:19,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:19,680 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:19,680 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4101|]. (let ((.cse0 (select |v_#memory_int_4101| ULTIMATE.start_main_p1))) (and (= .cse0 88) (= (store |v_#memory_int_4101| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:19,680 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 89) [2019-05-15 10:40:19,748 INFO L273 TraceCheckUtils]: 0: Hoare triple {34724#true} havoc main_p1; {34724#true} is VALID [2019-05-15 10:40:19,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {34724#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {34724#true} is VALID [2019-05-15 10:40:19,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {34724#true} #memory_int := #memory_int[main_p1 := 0]; {34735#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:40:19,749 INFO L273 TraceCheckUtils]: 3: Hoare triple {34735#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34739#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:40:19,750 INFO L273 TraceCheckUtils]: 4: Hoare triple {34739#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34743#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:40:19,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {34743#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34747#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:40:19,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {34747#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34751#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:40:19,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {34751#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34755#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:40:19,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {34755#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34759#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:40:19,752 INFO L273 TraceCheckUtils]: 9: Hoare triple {34759#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34763#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:40:19,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {34763#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34767#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:40:19,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {34767#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34771#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:40:19,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {34771#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34775#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:40:19,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {34775#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34779#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:40:19,756 INFO L273 TraceCheckUtils]: 14: Hoare triple {34779#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34783#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:40:19,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {34783#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34787#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:40:19,757 INFO L273 TraceCheckUtils]: 16: Hoare triple {34787#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34791#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:40:19,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {34791#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34795#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:40:19,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {34795#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34799#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:40:19,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {34799#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34803#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:40:19,760 INFO L273 TraceCheckUtils]: 20: Hoare triple {34803#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34807#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:40:19,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {34807#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34811#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:40:19,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {34811#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34815#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:40:19,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {34815#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34819#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:40:19,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {34819#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34823#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:40:19,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {34823#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34827#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:40:19,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {34827#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34831#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:40:19,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {34831#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34835#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:40:19,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {34835#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34839#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:40:19,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {34839#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34843#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:40:19,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {34843#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34847#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:40:19,769 INFO L273 TraceCheckUtils]: 31: Hoare triple {34847#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34851#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:40:19,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {34851#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34855#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:40:19,770 INFO L273 TraceCheckUtils]: 33: Hoare triple {34855#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34859#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:40:19,771 INFO L273 TraceCheckUtils]: 34: Hoare triple {34859#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34863#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:40:19,772 INFO L273 TraceCheckUtils]: 35: Hoare triple {34863#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34867#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:40:19,772 INFO L273 TraceCheckUtils]: 36: Hoare triple {34867#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34871#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:40:19,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {34871#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34875#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:40:19,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {34875#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34879#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:40:19,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {34879#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34883#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:40:19,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {34883#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34887#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:40:19,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {34887#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34891#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:40:19,777 INFO L273 TraceCheckUtils]: 42: Hoare triple {34891#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34895#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:40:19,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {34895#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34899#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:40:19,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {34899#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34903#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:40:19,779 INFO L273 TraceCheckUtils]: 45: Hoare triple {34903#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34907#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:40:19,780 INFO L273 TraceCheckUtils]: 46: Hoare triple {34907#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34911#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:40:19,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {34911#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34915#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:40:19,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {34915#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34919#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:40:19,782 INFO L273 TraceCheckUtils]: 49: Hoare triple {34919#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34923#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:40:19,783 INFO L273 TraceCheckUtils]: 50: Hoare triple {34923#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34927#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:40:19,784 INFO L273 TraceCheckUtils]: 51: Hoare triple {34927#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34931#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:40:19,784 INFO L273 TraceCheckUtils]: 52: Hoare triple {34931#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34935#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:40:19,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {34935#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34939#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:40:19,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {34939#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34943#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:40:19,787 INFO L273 TraceCheckUtils]: 55: Hoare triple {34943#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34947#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:40:19,787 INFO L273 TraceCheckUtils]: 56: Hoare triple {34947#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34951#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:40:19,788 INFO L273 TraceCheckUtils]: 57: Hoare triple {34951#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34955#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:40:19,789 INFO L273 TraceCheckUtils]: 58: Hoare triple {34955#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34959#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:40:19,790 INFO L273 TraceCheckUtils]: 59: Hoare triple {34959#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34963#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:40:19,790 INFO L273 TraceCheckUtils]: 60: Hoare triple {34963#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34967#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:40:19,791 INFO L273 TraceCheckUtils]: 61: Hoare triple {34967#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34971#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:40:19,792 INFO L273 TraceCheckUtils]: 62: Hoare triple {34971#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34975#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:40:19,793 INFO L273 TraceCheckUtils]: 63: Hoare triple {34975#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34979#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:40:19,793 INFO L273 TraceCheckUtils]: 64: Hoare triple {34979#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34983#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:40:19,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {34983#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34987#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:40:19,795 INFO L273 TraceCheckUtils]: 66: Hoare triple {34987#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34991#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:40:19,795 INFO L273 TraceCheckUtils]: 67: Hoare triple {34991#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34995#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:40:19,796 INFO L273 TraceCheckUtils]: 68: Hoare triple {34995#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {34999#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:40:19,797 INFO L273 TraceCheckUtils]: 69: Hoare triple {34999#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35003#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:40:19,798 INFO L273 TraceCheckUtils]: 70: Hoare triple {35003#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35007#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:40:19,799 INFO L273 TraceCheckUtils]: 71: Hoare triple {35007#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35011#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:40:19,799 INFO L273 TraceCheckUtils]: 72: Hoare triple {35011#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35015#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:40:19,800 INFO L273 TraceCheckUtils]: 73: Hoare triple {35015#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35019#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:40:19,801 INFO L273 TraceCheckUtils]: 74: Hoare triple {35019#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35023#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:40:19,802 INFO L273 TraceCheckUtils]: 75: Hoare triple {35023#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35027#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:40:19,802 INFO L273 TraceCheckUtils]: 76: Hoare triple {35027#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35031#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:40:19,803 INFO L273 TraceCheckUtils]: 77: Hoare triple {35031#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35035#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:40:19,804 INFO L273 TraceCheckUtils]: 78: Hoare triple {35035#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35039#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:40:19,805 INFO L273 TraceCheckUtils]: 79: Hoare triple {35039#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35043#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:40:19,805 INFO L273 TraceCheckUtils]: 80: Hoare triple {35043#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35047#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:40:19,806 INFO L273 TraceCheckUtils]: 81: Hoare triple {35047#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35051#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:40:19,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {35051#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35055#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:40:19,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {35055#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35059#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:40:19,808 INFO L273 TraceCheckUtils]: 84: Hoare triple {35059#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35063#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:40:19,809 INFO L273 TraceCheckUtils]: 85: Hoare triple {35063#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35067#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:40:19,810 INFO L273 TraceCheckUtils]: 86: Hoare triple {35067#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35071#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:40:19,810 INFO L273 TraceCheckUtils]: 87: Hoare triple {35071#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35075#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:40:19,811 INFO L273 TraceCheckUtils]: 88: Hoare triple {35075#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35079#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:40:19,812 INFO L273 TraceCheckUtils]: 89: Hoare triple {35079#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35083#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:40:19,813 INFO L273 TraceCheckUtils]: 90: Hoare triple {35083#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35087#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:40:19,813 INFO L273 TraceCheckUtils]: 91: Hoare triple {35087#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35091#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} is VALID [2019-05-15 10:40:19,814 INFO L273 TraceCheckUtils]: 92: Hoare triple {35091#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} assume !(#memory_int[main_p1] >= 0); {34725#false} is VALID [2019-05-15 10:40:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:19,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:19,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-15 10:40:19,825 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-05-15 10:40:19,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:19,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states. [2019-05-15 10:40:19,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:19,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-05-15 10:40:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-15 10:40:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:40:19,899 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 92 states. [2019-05-15 10:40:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:36,597 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:36,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-15 10:40:36,597 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 93 [2019-05-15 10:40:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:40:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:40:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-05-15 10:40:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2019-05-15 10:40:36,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2019-05-15 10:40:36,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:36,678 INFO L225 Difference]: With dead ends: 95 [2019-05-15 10:40:36,678 INFO L226 Difference]: Without dead ends: 95 [2019-05-15 10:40:36,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2019-05-15 10:40:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-05-15 10:40:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-05-15 10:40:36,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:36,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:36,680 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:36,680 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:36,681 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:36,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:36,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:36,682 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:36,682 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 95 states. [2019-05-15 10:40:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:36,683 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-05-15 10:40:36,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:36,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:36,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:36,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:36,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-05-15 10:40:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-05-15 10:40:36,684 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-05-15 10:40:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:36,684 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-05-15 10:40:36,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-05-15 10:40:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-05-15 10:40:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-05-15 10:40:36,685 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:36,685 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-05-15 10:40:36,685 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:36,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1061581256, now seen corresponding path program 90 times [2019-05-15 10:40:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:36,719 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-15 10:40:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:36,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:36,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:40:36,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:36,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,750 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4102|]. (= (store |v_#memory_int_4102| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:40:36,750 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:36,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,770 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,770 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4103|]. (let ((.cse0 (select |v_#memory_int_4103| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4103| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0))) [2019-05-15 10:40:36,770 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:36,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,792 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,792 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4104|]. (let ((.cse0 (select |v_#memory_int_4104| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4104| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 1 .cse0))) [2019-05-15 10:40:36,792 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:36,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,814 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,814 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4105|]. (let ((.cse0 (select |v_#memory_int_4105| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4105| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 2 .cse0))) [2019-05-15 10:40:36,814 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:36,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,837 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,837 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4106|]. (let ((.cse0 (select |v_#memory_int_4106| ULTIMATE.start_main_p1))) (and (= 3 .cse0) (= |#memory_int| (store |v_#memory_int_4106| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:36,837 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:36,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,860 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,860 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4107|]. (let ((.cse0 (select |v_#memory_int_4107| ULTIMATE.start_main_p1))) (and (= .cse0 4) (= |#memory_int| (store |v_#memory_int_4107| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:36,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:36,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,884 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,885 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4108|]. (let ((.cse0 (select |v_#memory_int_4108| ULTIMATE.start_main_p1))) (and (= .cse0 5) (= (store |v_#memory_int_4108| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:36,885 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:36,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,909 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,909 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4109|]. (let ((.cse0 (select |v_#memory_int_4109| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4109| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 6))) [2019-05-15 10:40:36,909 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:36,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,932 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,932 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4110|]. (let ((.cse0 (select |v_#memory_int_4110| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4110| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 7))) [2019-05-15 10:40:36,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:36,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,959 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,960 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4111|]. (let ((.cse0 (select |v_#memory_int_4111| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4111| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 8 .cse0))) [2019-05-15 10:40:36,960 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:36,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:36,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:36,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:36,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:36,986 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:36,986 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4112|]. (let ((.cse0 (select |v_#memory_int_4112| ULTIMATE.start_main_p1))) (and (= .cse0 9) (= (store |v_#memory_int_4112| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:36,986 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:37,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,013 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4113|]. (let ((.cse0 (select |v_#memory_int_4113| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4113| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:40:37,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:37,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4114|]. (let ((.cse0 (select |v_#memory_int_4114| ULTIMATE.start_main_p1))) (and (= 11 .cse0) (= (store |v_#memory_int_4114| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,050 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:37,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,081 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,081 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4115|]. (let ((.cse0 (select |v_#memory_int_4115| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= (store |v_#memory_int_4115| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,081 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:37,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,112 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,112 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4116|]. (let ((.cse0 (select |v_#memory_int_4116| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4116| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 13))) [2019-05-15 10:40:37,112 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:37,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,136 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4117|]. (let ((.cse0 (select |v_#memory_int_4117| ULTIMATE.start_main_p1))) (and (= 14 .cse0) (= (store |v_#memory_int_4117| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:37,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,178 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,178 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4118|]. (let ((.cse0 (select |v_#memory_int_4118| ULTIMATE.start_main_p1))) (and (= .cse0 15) (= (store |v_#memory_int_4118| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,178 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:37,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4119|]. (let ((.cse0 (select |v_#memory_int_4119| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4119| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 16))) [2019-05-15 10:40:37,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:37,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,243 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,243 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4120|]. (let ((.cse0 (select |v_#memory_int_4120| ULTIMATE.start_main_p1))) (and (= 17 .cse0) (= (store |v_#memory_int_4120| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,243 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:37,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,276 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,276 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4121|]. (let ((.cse0 (select |v_#memory_int_4121| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4121| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 18))) [2019-05-15 10:40:37,276 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:37,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,311 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,312 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4122|]. (let ((.cse0 (select |v_#memory_int_4122| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4122| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 19))) [2019-05-15 10:40:37,312 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:37,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,347 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,347 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4123|]. (let ((.cse0 (select |v_#memory_int_4123| ULTIMATE.start_main_p1))) (and (= 20 .cse0) (= (store |v_#memory_int_4123| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,347 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:37,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,385 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,385 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4124|]. (let ((.cse0 (select |v_#memory_int_4124| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4124| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 21 .cse0))) [2019-05-15 10:40:37,385 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:37,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,423 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,424 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4125|]. (let ((.cse0 (select |v_#memory_int_4125| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4125| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:40:37,424 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:37,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,461 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,462 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4126|]. (let ((.cse0 (select |v_#memory_int_4126| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4126| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 23))) [2019-05-15 10:40:37,462 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:37,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,498 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,499 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4127|]. (let ((.cse0 (select |v_#memory_int_4127| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= |#memory_int| (store |v_#memory_int_4127| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:37,499 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:37,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,539 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,539 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4128|]. (let ((.cse0 (select |v_#memory_int_4128| ULTIMATE.start_main_p1))) (and (= 25 .cse0) (= |#memory_int| (store |v_#memory_int_4128| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:37,539 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:37,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,579 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,579 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4129|]. (let ((.cse0 (select |v_#memory_int_4129| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4129| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:40:37,580 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:37,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,626 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,626 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4130|]. (let ((.cse0 (select |v_#memory_int_4130| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4130| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:40:37,626 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:37,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,666 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,666 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4131|]. (let ((.cse0 (select |v_#memory_int_4131| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4131| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:40:37,666 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:37,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,707 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,708 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4132|]. (let ((.cse0 (select |v_#memory_int_4132| ULTIMATE.start_main_p1))) (and (= 29 .cse0) (= (store |v_#memory_int_4132| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,708 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:37,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,749 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,749 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4133|]. (let ((.cse0 (select |v_#memory_int_4133| ULTIMATE.start_main_p1))) (and (= .cse0 30) (= (store |v_#memory_int_4133| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,749 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:37,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,794 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,794 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4134|]. (let ((.cse0 (select |v_#memory_int_4134| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4134| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 31 .cse0))) [2019-05-15 10:40:37,794 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:37,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,839 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,839 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4135|]. (let ((.cse0 (select |v_#memory_int_4135| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4135| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 32 .cse0))) [2019-05-15 10:40:37,839 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:40:37,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,886 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,886 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4136|]. (let ((.cse0 (select |v_#memory_int_4136| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= |#memory_int| (store |v_#memory_int_4136| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:37,886 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:40:37,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4137|]. (let ((.cse0 (select |v_#memory_int_4137| ULTIMATE.start_main_p1))) (and (= .cse0 34) (= (store |v_#memory_int_4137| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:37,931 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:40:37,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:37,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:37,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:37,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:37,980 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:37,980 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4138|]. (let ((.cse0 (select |v_#memory_int_4138| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4138| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 35))) [2019-05-15 10:40:37,980 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:40:38,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,028 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,028 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4139|]. (let ((.cse0 (select |v_#memory_int_4139| ULTIMATE.start_main_p1))) (and (= 36 .cse0) (= |#memory_int| (store |v_#memory_int_4139| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:38,028 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:40:38,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,075 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4140|]. (let ((.cse0 (select |v_#memory_int_4140| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4140| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 37 .cse0))) [2019-05-15 10:40:38,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:40:38,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,131 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4141|]. (let ((.cse0 (select |v_#memory_int_4141| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4141| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 38))) [2019-05-15 10:40:38,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:40:38,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4142|]. (let ((.cse0 (select |v_#memory_int_4142| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4142| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 39 .cse0))) [2019-05-15 10:40:38,181 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:40:38,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,229 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,230 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4143|]. (let ((.cse0 (select |v_#memory_int_4143| ULTIMATE.start_main_p1))) (and (= .cse0 40) (= (store |v_#memory_int_4143| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:38,230 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:40:38,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,283 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,283 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4144|]. (let ((.cse0 (select |v_#memory_int_4144| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_4144| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:38,283 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:40:38,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,334 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,334 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4145|]. (let ((.cse0 (select |v_#memory_int_4145| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4145| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:40:38,334 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:40:38,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,389 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,389 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4146|]. (let ((.cse0 (select |v_#memory_int_4146| ULTIMATE.start_main_p1))) (and (= .cse0 43) (= (store |v_#memory_int_4146| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:38,389 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:40:38,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,444 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,444 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4147|]. (let ((.cse0 (select |v_#memory_int_4147| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4147| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:40:38,444 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:40:38,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,500 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,500 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4148|]. (let ((.cse0 (select |v_#memory_int_4148| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= |#memory_int| (store |v_#memory_int_4148| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:38,500 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:40:38,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,558 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,559 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4149|]. (let ((.cse0 (select |v_#memory_int_4149| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4149| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 46 .cse0))) [2019-05-15 10:40:38,559 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:40:38,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,612 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,612 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4150|]. (let ((.cse0 (select |v_#memory_int_4150| ULTIMATE.start_main_p1))) (and (= 47 .cse0) (= |#memory_int| (store |v_#memory_int_4150| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:38,612 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:40:38,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,675 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,675 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4151|]. (let ((.cse0 (select |v_#memory_int_4151| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4151| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 48 .cse0))) [2019-05-15 10:40:38,675 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:40:38,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,729 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,729 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4152|]. (let ((.cse0 (select |v_#memory_int_4152| ULTIMATE.start_main_p1))) (and (= .cse0 49) (= (store |v_#memory_int_4152| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:38,729 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:40:38,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,786 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,786 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4153|]. (let ((.cse0 (select |v_#memory_int_4153| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4153| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 50))) [2019-05-15 10:40:38,787 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:40:38,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,844 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,844 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4154|]. (let ((.cse0 (select |v_#memory_int_4154| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4154| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 51 .cse0))) [2019-05-15 10:40:38,845 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:40:38,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,902 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,902 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4155|]. (let ((.cse0 (select |v_#memory_int_4155| ULTIMATE.start_main_p1))) (and (= .cse0 52) (= |#memory_int| (store |v_#memory_int_4155| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:38,902 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:40:38,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:38,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:38,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:38,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:38,962 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:38,963 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4156|]. (let ((.cse0 (select |v_#memory_int_4156| ULTIMATE.start_main_p1))) (and (= .cse0 53) (= |#memory_int| (store |v_#memory_int_4156| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:38,963 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:40:39,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,022 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,022 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4157|]. (let ((.cse0 (select |v_#memory_int_4157| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_4157| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:39,022 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:40:39,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,082 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,082 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4158|]. (let ((.cse0 (select |v_#memory_int_4158| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4158| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 55 .cse0))) [2019-05-15 10:40:39,082 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:40:39,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,145 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,145 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4159|]. (let ((.cse0 (select |v_#memory_int_4159| ULTIMATE.start_main_p1))) (and (= .cse0 56) (= (store |v_#memory_int_4159| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:39,145 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:40:39,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4160|]. (let ((.cse0 (select |v_#memory_int_4160| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= |#memory_int| (store |v_#memory_int_4160| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:39,210 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:40:39,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,278 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,278 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4161|]. (let ((.cse0 (select |v_#memory_int_4161| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4161| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 58 .cse0))) [2019-05-15 10:40:39,278 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:40:39,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,335 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4162|]. (let ((.cse0 (select |v_#memory_int_4162| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4162| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 59 .cse0))) [2019-05-15 10:40:39,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:40:39,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,407 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,407 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4163|]. (let ((.cse0 (select |v_#memory_int_4163| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4163| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 60 .cse0))) [2019-05-15 10:40:39,407 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:40:39,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,471 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4164|]. (let ((.cse0 (select |v_#memory_int_4164| ULTIMATE.start_main_p1))) (and (= .cse0 61) (= |#memory_int| (store |v_#memory_int_4164| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:39,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:40:39,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,540 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,540 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4165|]. (let ((.cse0 (select |v_#memory_int_4165| ULTIMATE.start_main_p1))) (and (= 62 .cse0) (= |#memory_int| (store |v_#memory_int_4165| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:39,540 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:40:39,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,611 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,611 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4166|]. (let ((.cse0 (select |v_#memory_int_4166| ULTIMATE.start_main_p1))) (and (= .cse0 63) (= (store |v_#memory_int_4166| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:39,611 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:40:39,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,677 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,677 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4167|]. (let ((.cse0 (select |v_#memory_int_4167| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4167| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 64))) [2019-05-15 10:40:39,677 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:40:39,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,739 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,747 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,748 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4168|]. (let ((.cse0 (select |v_#memory_int_4168| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= (store |v_#memory_int_4168| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:39,748 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:40:39,808 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,819 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,819 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4169|]. (let ((.cse0 (select |v_#memory_int_4169| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4169| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 66 .cse0))) [2019-05-15 10:40:39,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:40:39,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,891 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,891 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4170|]. (let ((.cse0 (select |v_#memory_int_4170| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4170| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 67 .cse0))) [2019-05-15 10:40:39,891 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:40:39,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:39,956 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:39,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:39,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:39,966 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:39,966 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4171|]. (let ((.cse0 (select |v_#memory_int_4171| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4171| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 68 .cse0))) [2019-05-15 10:40:39,966 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:40:40,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,044 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,044 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4172|]. (let ((.cse0 (select |v_#memory_int_4172| ULTIMATE.start_main_p1))) (and (= 69 .cse0) (= (store |v_#memory_int_4172| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:40,044 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:40:40,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,116 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,116 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4173|]. (let ((.cse0 (select |v_#memory_int_4173| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4173| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 70))) [2019-05-15 10:40:40,116 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:40:40,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,191 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,191 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4174|]. (let ((.cse0 (select |v_#memory_int_4174| ULTIMATE.start_main_p1))) (and (= 71 .cse0) (= |#memory_int| (store |v_#memory_int_4174| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:40,191 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:40:40,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,267 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,267 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4175|]. (let ((.cse0 (select |v_#memory_int_4175| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4175| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 72 .cse0))) [2019-05-15 10:40:40,267 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:40:40,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,341 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,342 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4176|]. (let ((.cse0 (select |v_#memory_int_4176| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4176| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 73 .cse0))) [2019-05-15 10:40:40,342 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:40:40,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,418 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,419 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4177|]. (let ((.cse0 (select |v_#memory_int_4177| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4177| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 74))) [2019-05-15 10:40:40,419 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:40:40,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,496 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,496 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4178|]. (let ((.cse0 (select |v_#memory_int_4178| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4178| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 75 .cse0))) [2019-05-15 10:40:40,496 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76) [2019-05-15 10:40:40,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,577 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,577 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4179|]. (let ((.cse0 (select |v_#memory_int_4179| ULTIMATE.start_main_p1))) (and (= .cse0 76) (= (store |v_#memory_int_4179| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:40,577 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 77) [2019-05-15 10:40:40,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,654 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,654 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4180|]. (let ((.cse0 (select |v_#memory_int_4180| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4180| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 77 .cse0))) [2019-05-15 10:40:40,654 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 78) [2019-05-15 10:40:40,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4181|]. (let ((.cse0 (select |v_#memory_int_4181| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4181| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 78 .cse0))) [2019-05-15 10:40:40,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 79) [2019-05-15 10:40:40,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,808 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,808 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4182|]. (let ((.cse0 (select |v_#memory_int_4182| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4182| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 79))) [2019-05-15 10:40:40,808 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 80) [2019-05-15 10:40:40,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,890 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,890 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4183|]. (let ((.cse0 (select |v_#memory_int_4183| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4183| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 80 .cse0))) [2019-05-15 10:40:40,890 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 81) [2019-05-15 10:40:40,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:40,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:40,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:40,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:40,968 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:40,968 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4184|]. (let ((.cse0 (select |v_#memory_int_4184| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4184| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 81))) [2019-05-15 10:40:40,968 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 82) [2019-05-15 10:40:41,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,051 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,051 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4185|]. (let ((.cse0 (select |v_#memory_int_4185| ULTIMATE.start_main_p1))) (and (= .cse0 82) (= (store |v_#memory_int_4185| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:41,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 83) [2019-05-15 10:40:41,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,130 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,131 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4186|]. (let ((.cse0 (select |v_#memory_int_4186| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4186| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 83 .cse0))) [2019-05-15 10:40:41,131 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 84) [2019-05-15 10:40:41,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,217 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,217 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4187|]. (let ((.cse0 (select |v_#memory_int_4187| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4187| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 84))) [2019-05-15 10:40:41,217 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 85) [2019-05-15 10:40:41,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,290 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,300 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,301 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4188|]. (let ((.cse0 (select |v_#memory_int_4188| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4188| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 85))) [2019-05-15 10:40:41,301 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 86) [2019-05-15 10:40:41,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,377 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,386 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,386 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4189|]. (let ((.cse0 (select |v_#memory_int_4189| ULTIMATE.start_main_p1))) (and (= 86 .cse0) (= (store |v_#memory_int_4189| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:41,386 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 87) [2019-05-15 10:40:41,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,462 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,473 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,473 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4190|]. (let ((.cse0 (select |v_#memory_int_4190| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4190| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 87))) [2019-05-15 10:40:41,473 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 88) [2019-05-15 10:40:41,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,562 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,562 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4191|]. (let ((.cse0 (select |v_#memory_int_4191| ULTIMATE.start_main_p1))) (and (= .cse0 88) (= |#memory_int| (store |v_#memory_int_4191| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:41,562 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 89) [2019-05-15 10:40:41,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:41,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:41,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:41,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:41,649 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:41,650 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4192|]. (let ((.cse0 (select |v_#memory_int_4192| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4192| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 89 .cse0))) [2019-05-15 10:40:41,650 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 90) [2019-05-15 10:40:41,719 INFO L273 TraceCheckUtils]: 0: Hoare triple {35474#true} havoc main_p1; {35474#true} is VALID [2019-05-15 10:40:41,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {35474#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {35474#true} is VALID [2019-05-15 10:40:41,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {35474#true} #memory_int := #memory_int[main_p1 := 0]; {35485#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-05-15 10:40:41,720 INFO L273 TraceCheckUtils]: 3: Hoare triple {35485#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35489#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-05-15 10:40:41,721 INFO L273 TraceCheckUtils]: 4: Hoare triple {35489#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35493#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} is VALID [2019-05-15 10:40:41,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {35493#(= (select |#memory_int| ULTIMATE.start_main_p1) 2)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35497#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} is VALID [2019-05-15 10:40:41,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {35497#(= (select |#memory_int| ULTIMATE.start_main_p1) 3)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35501#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} is VALID [2019-05-15 10:40:41,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {35501#(= (select |#memory_int| ULTIMATE.start_main_p1) 4)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35505#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} is VALID [2019-05-15 10:40:41,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {35505#(= (select |#memory_int| ULTIMATE.start_main_p1) 5)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35509#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} is VALID [2019-05-15 10:40:41,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {35509#(= (select |#memory_int| ULTIMATE.start_main_p1) 6)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35513#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} is VALID [2019-05-15 10:40:41,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {35513#(= (select |#memory_int| ULTIMATE.start_main_p1) 7)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35517#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} is VALID [2019-05-15 10:40:41,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {35517#(= (select |#memory_int| ULTIMATE.start_main_p1) 8)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35521#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} is VALID [2019-05-15 10:40:41,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {35521#(= (select |#memory_int| ULTIMATE.start_main_p1) 9)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35525#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} is VALID [2019-05-15 10:40:41,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {35525#(= (select |#memory_int| ULTIMATE.start_main_p1) 10)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35529#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} is VALID [2019-05-15 10:40:41,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {35529#(= (select |#memory_int| ULTIMATE.start_main_p1) 11)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35533#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} is VALID [2019-05-15 10:40:41,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {35533#(= (select |#memory_int| ULTIMATE.start_main_p1) 12)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35537#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} is VALID [2019-05-15 10:40:41,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {35537#(= (select |#memory_int| ULTIMATE.start_main_p1) 13)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35541#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} is VALID [2019-05-15 10:40:41,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {35541#(= (select |#memory_int| ULTIMATE.start_main_p1) 14)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35545#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} is VALID [2019-05-15 10:40:41,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {35545#(= (select |#memory_int| ULTIMATE.start_main_p1) 15)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35549#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} is VALID [2019-05-15 10:40:41,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {35549#(= (select |#memory_int| ULTIMATE.start_main_p1) 16)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35553#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} is VALID [2019-05-15 10:40:41,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {35553#(= (select |#memory_int| ULTIMATE.start_main_p1) 17)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35557#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} is VALID [2019-05-15 10:40:41,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {35557#(= (select |#memory_int| ULTIMATE.start_main_p1) 18)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35561#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} is VALID [2019-05-15 10:40:41,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {35561#(= (select |#memory_int| ULTIMATE.start_main_p1) 19)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35565#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} is VALID [2019-05-15 10:40:41,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {35565#(= (select |#memory_int| ULTIMATE.start_main_p1) 20)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35569#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} is VALID [2019-05-15 10:40:41,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {35569#(= (select |#memory_int| ULTIMATE.start_main_p1) 21)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35573#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} is VALID [2019-05-15 10:40:41,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {35573#(= (select |#memory_int| ULTIMATE.start_main_p1) 22)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35577#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} is VALID [2019-05-15 10:40:41,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {35577#(= (select |#memory_int| ULTIMATE.start_main_p1) 23)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35581#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} is VALID [2019-05-15 10:40:41,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {35581#(= (select |#memory_int| ULTIMATE.start_main_p1) 24)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35585#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} is VALID [2019-05-15 10:40:41,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {35585#(= (select |#memory_int| ULTIMATE.start_main_p1) 25)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35589#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} is VALID [2019-05-15 10:40:41,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {35589#(= (select |#memory_int| ULTIMATE.start_main_p1) 26)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35593#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} is VALID [2019-05-15 10:40:41,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {35593#(= (select |#memory_int| ULTIMATE.start_main_p1) 27)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35597#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} is VALID [2019-05-15 10:40:41,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {35597#(= (select |#memory_int| ULTIMATE.start_main_p1) 28)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35601#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} is VALID [2019-05-15 10:40:41,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {35601#(= (select |#memory_int| ULTIMATE.start_main_p1) 29)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35605#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} is VALID [2019-05-15 10:40:41,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {35605#(= (select |#memory_int| ULTIMATE.start_main_p1) 30)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35609#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} is VALID [2019-05-15 10:40:41,742 INFO L273 TraceCheckUtils]: 34: Hoare triple {35609#(= (select |#memory_int| ULTIMATE.start_main_p1) 31)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35613#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} is VALID [2019-05-15 10:40:41,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {35613#(= (select |#memory_int| ULTIMATE.start_main_p1) 32)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35617#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} is VALID [2019-05-15 10:40:41,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {35617#(= (select |#memory_int| ULTIMATE.start_main_p1) 33)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35621#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} is VALID [2019-05-15 10:40:41,744 INFO L273 TraceCheckUtils]: 37: Hoare triple {35621#(= (select |#memory_int| ULTIMATE.start_main_p1) 34)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35625#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} is VALID [2019-05-15 10:40:41,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {35625#(= (select |#memory_int| ULTIMATE.start_main_p1) 35)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35629#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} is VALID [2019-05-15 10:40:41,746 INFO L273 TraceCheckUtils]: 39: Hoare triple {35629#(= (select |#memory_int| ULTIMATE.start_main_p1) 36)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35633#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} is VALID [2019-05-15 10:40:41,746 INFO L273 TraceCheckUtils]: 40: Hoare triple {35633#(= (select |#memory_int| ULTIMATE.start_main_p1) 37)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35637#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} is VALID [2019-05-15 10:40:41,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {35637#(= (select |#memory_int| ULTIMATE.start_main_p1) 38)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35641#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} is VALID [2019-05-15 10:40:41,748 INFO L273 TraceCheckUtils]: 42: Hoare triple {35641#(= (select |#memory_int| ULTIMATE.start_main_p1) 39)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35645#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} is VALID [2019-05-15 10:40:41,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {35645#(= (select |#memory_int| ULTIMATE.start_main_p1) 40)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35649#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} is VALID [2019-05-15 10:40:41,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {35649#(= (select |#memory_int| ULTIMATE.start_main_p1) 41)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35653#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} is VALID [2019-05-15 10:40:41,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {35653#(= (select |#memory_int| ULTIMATE.start_main_p1) 42)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35657#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} is VALID [2019-05-15 10:40:41,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {35657#(= (select |#memory_int| ULTIMATE.start_main_p1) 43)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35661#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} is VALID [2019-05-15 10:40:41,752 INFO L273 TraceCheckUtils]: 47: Hoare triple {35661#(= (select |#memory_int| ULTIMATE.start_main_p1) 44)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35665#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} is VALID [2019-05-15 10:40:41,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {35665#(= (select |#memory_int| ULTIMATE.start_main_p1) 45)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35669#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} is VALID [2019-05-15 10:40:41,753 INFO L273 TraceCheckUtils]: 49: Hoare triple {35669#(= (select |#memory_int| ULTIMATE.start_main_p1) 46)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35673#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} is VALID [2019-05-15 10:40:41,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {35673#(= (select |#memory_int| ULTIMATE.start_main_p1) 47)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35677#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} is VALID [2019-05-15 10:40:41,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {35677#(= (select |#memory_int| ULTIMATE.start_main_p1) 48)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35681#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} is VALID [2019-05-15 10:40:41,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {35681#(= (select |#memory_int| ULTIMATE.start_main_p1) 49)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35685#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} is VALID [2019-05-15 10:40:41,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {35685#(= (select |#memory_int| ULTIMATE.start_main_p1) 50)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35689#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} is VALID [2019-05-15 10:40:41,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {35689#(= (select |#memory_int| ULTIMATE.start_main_p1) 51)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35693#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} is VALID [2019-05-15 10:40:41,758 INFO L273 TraceCheckUtils]: 55: Hoare triple {35693#(= (select |#memory_int| ULTIMATE.start_main_p1) 52)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35697#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} is VALID [2019-05-15 10:40:41,759 INFO L273 TraceCheckUtils]: 56: Hoare triple {35697#(= (select |#memory_int| ULTIMATE.start_main_p1) 53)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35701#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} is VALID [2019-05-15 10:40:41,760 INFO L273 TraceCheckUtils]: 57: Hoare triple {35701#(= (select |#memory_int| ULTIMATE.start_main_p1) 54)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35705#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} is VALID [2019-05-15 10:40:41,760 INFO L273 TraceCheckUtils]: 58: Hoare triple {35705#(= (select |#memory_int| ULTIMATE.start_main_p1) 55)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35709#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} is VALID [2019-05-15 10:40:41,761 INFO L273 TraceCheckUtils]: 59: Hoare triple {35709#(= (select |#memory_int| ULTIMATE.start_main_p1) 56)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35713#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} is VALID [2019-05-15 10:40:41,762 INFO L273 TraceCheckUtils]: 60: Hoare triple {35713#(= (select |#memory_int| ULTIMATE.start_main_p1) 57)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35717#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} is VALID [2019-05-15 10:40:41,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {35717#(= (select |#memory_int| ULTIMATE.start_main_p1) 58)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35721#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} is VALID [2019-05-15 10:40:41,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {35721#(= (select |#memory_int| ULTIMATE.start_main_p1) 59)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35725#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} is VALID [2019-05-15 10:40:41,764 INFO L273 TraceCheckUtils]: 63: Hoare triple {35725#(= (select |#memory_int| ULTIMATE.start_main_p1) 60)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35729#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} is VALID [2019-05-15 10:40:41,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {35729#(= (select |#memory_int| ULTIMATE.start_main_p1) 61)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35733#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} is VALID [2019-05-15 10:40:41,766 INFO L273 TraceCheckUtils]: 65: Hoare triple {35733#(= (select |#memory_int| ULTIMATE.start_main_p1) 62)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35737#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} is VALID [2019-05-15 10:40:41,767 INFO L273 TraceCheckUtils]: 66: Hoare triple {35737#(= (select |#memory_int| ULTIMATE.start_main_p1) 63)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35741#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} is VALID [2019-05-15 10:40:41,767 INFO L273 TraceCheckUtils]: 67: Hoare triple {35741#(= (select |#memory_int| ULTIMATE.start_main_p1) 64)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35745#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} is VALID [2019-05-15 10:40:41,768 INFO L273 TraceCheckUtils]: 68: Hoare triple {35745#(= (select |#memory_int| ULTIMATE.start_main_p1) 65)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35749#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} is VALID [2019-05-15 10:40:41,769 INFO L273 TraceCheckUtils]: 69: Hoare triple {35749#(= (select |#memory_int| ULTIMATE.start_main_p1) 66)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35753#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} is VALID [2019-05-15 10:40:41,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {35753#(= (select |#memory_int| ULTIMATE.start_main_p1) 67)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35757#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} is VALID [2019-05-15 10:40:41,770 INFO L273 TraceCheckUtils]: 71: Hoare triple {35757#(= (select |#memory_int| ULTIMATE.start_main_p1) 68)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35761#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} is VALID [2019-05-15 10:40:41,771 INFO L273 TraceCheckUtils]: 72: Hoare triple {35761#(= (select |#memory_int| ULTIMATE.start_main_p1) 69)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35765#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} is VALID [2019-05-15 10:40:41,772 INFO L273 TraceCheckUtils]: 73: Hoare triple {35765#(= (select |#memory_int| ULTIMATE.start_main_p1) 70)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35769#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} is VALID [2019-05-15 10:40:41,773 INFO L273 TraceCheckUtils]: 74: Hoare triple {35769#(= (select |#memory_int| ULTIMATE.start_main_p1) 71)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35773#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} is VALID [2019-05-15 10:40:41,773 INFO L273 TraceCheckUtils]: 75: Hoare triple {35773#(= (select |#memory_int| ULTIMATE.start_main_p1) 72)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35777#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} is VALID [2019-05-15 10:40:41,774 INFO L273 TraceCheckUtils]: 76: Hoare triple {35777#(= (select |#memory_int| ULTIMATE.start_main_p1) 73)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35781#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} is VALID [2019-05-15 10:40:41,775 INFO L273 TraceCheckUtils]: 77: Hoare triple {35781#(= (select |#memory_int| ULTIMATE.start_main_p1) 74)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35785#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} is VALID [2019-05-15 10:40:41,776 INFO L273 TraceCheckUtils]: 78: Hoare triple {35785#(= (select |#memory_int| ULTIMATE.start_main_p1) 75)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35789#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} is VALID [2019-05-15 10:40:41,776 INFO L273 TraceCheckUtils]: 79: Hoare triple {35789#(= (select |#memory_int| ULTIMATE.start_main_p1) 76)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35793#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} is VALID [2019-05-15 10:40:41,777 INFO L273 TraceCheckUtils]: 80: Hoare triple {35793#(= (select |#memory_int| ULTIMATE.start_main_p1) 77)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35797#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} is VALID [2019-05-15 10:40:41,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {35797#(= (select |#memory_int| ULTIMATE.start_main_p1) 78)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35801#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} is VALID [2019-05-15 10:40:41,779 INFO L273 TraceCheckUtils]: 82: Hoare triple {35801#(= (select |#memory_int| ULTIMATE.start_main_p1) 79)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35805#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} is VALID [2019-05-15 10:40:41,779 INFO L273 TraceCheckUtils]: 83: Hoare triple {35805#(= (select |#memory_int| ULTIMATE.start_main_p1) 80)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35809#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} is VALID [2019-05-15 10:40:41,780 INFO L273 TraceCheckUtils]: 84: Hoare triple {35809#(= (select |#memory_int| ULTIMATE.start_main_p1) 81)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35813#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} is VALID [2019-05-15 10:40:41,781 INFO L273 TraceCheckUtils]: 85: Hoare triple {35813#(= (select |#memory_int| ULTIMATE.start_main_p1) 82)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35817#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} is VALID [2019-05-15 10:40:41,782 INFO L273 TraceCheckUtils]: 86: Hoare triple {35817#(= (select |#memory_int| ULTIMATE.start_main_p1) 83)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35821#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} is VALID [2019-05-15 10:40:41,782 INFO L273 TraceCheckUtils]: 87: Hoare triple {35821#(= (select |#memory_int| ULTIMATE.start_main_p1) 84)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35825#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} is VALID [2019-05-15 10:40:41,783 INFO L273 TraceCheckUtils]: 88: Hoare triple {35825#(= (select |#memory_int| ULTIMATE.start_main_p1) 85)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35829#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} is VALID [2019-05-15 10:40:41,784 INFO L273 TraceCheckUtils]: 89: Hoare triple {35829#(= (select |#memory_int| ULTIMATE.start_main_p1) 86)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35833#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} is VALID [2019-05-15 10:40:41,785 INFO L273 TraceCheckUtils]: 90: Hoare triple {35833#(= (select |#memory_int| ULTIMATE.start_main_p1) 87)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35837#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} is VALID [2019-05-15 10:40:41,785 INFO L273 TraceCheckUtils]: 91: Hoare triple {35837#(= (select |#memory_int| ULTIMATE.start_main_p1) 88)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35841#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} is VALID [2019-05-15 10:40:41,786 INFO L273 TraceCheckUtils]: 92: Hoare triple {35841#(= (select |#memory_int| ULTIMATE.start_main_p1) 89)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {35845#(= (select |#memory_int| ULTIMATE.start_main_p1) 90)} is VALID [2019-05-15 10:40:41,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {35845#(= (select |#memory_int| ULTIMATE.start_main_p1) 90)} assume !(#memory_int[main_p1] >= 0); {35475#false} is VALID [2019-05-15 10:40:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:40:41,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:40:41,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-15 10:40:41,803 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-05-15 10:40:41,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:40:41,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states. [2019-05-15 10:40:41,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:41,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-05-15 10:40:41,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-15 10:40:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2019-05-15 10:40:41,878 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 93 states. [2019-05-15 10:40:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:58,768 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-05-15 10:40:58,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-15 10:40:58,769 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 94 [2019-05-15 10:40:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:40:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-05-15 10:40:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-05-15 10:40:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-05-15 10:40:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-05-15 10:40:58,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 97 transitions. [2019-05-15 10:40:58,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:40:58,848 INFO L225 Difference]: With dead ends: 96 [2019-05-15 10:40:58,848 INFO L226 Difference]: Without dead ends: 96 [2019-05-15 10:40:58,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2019-05-15 10:40:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-05-15 10:40:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-05-15 10:40:58,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:40:58,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 96 states. [2019-05-15 10:40:58,850 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2019-05-15 10:40:58,850 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2019-05-15 10:40:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:58,851 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-05-15 10:40:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-05-15 10:40:58,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:58,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:58,851 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 96 states. [2019-05-15 10:40:58,852 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 96 states. [2019-05-15 10:40:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:40:58,852 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-05-15 10:40:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-05-15 10:40:58,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:40:58,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:40:58,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:40:58,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:40:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-05-15 10:40:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-05-15 10:40:58,854 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-05-15 10:40:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:40:58,854 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-05-15 10:40:58,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-05-15 10:40:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-05-15 10:40:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-05-15 10:40:58,854 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:40:58,855 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1] [2019-05-15 10:40:58,855 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:40:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:40:58,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1450719486, now seen corresponding path program 91 times [2019-05-15 10:40:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:40:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:58,887 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-15 10:40:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:40:58,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:40:58,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:40:58,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:58,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-05-15 10:40:58,916 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:58,916 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4193|]. (= (store |v_#memory_int_4193| ULTIMATE.start_main_p1 0) |#memory_int|) [2019-05-15 10:40:58,916 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-05-15 10:40:58,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:58,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:58,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:58,937 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:58,938 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4194|]. (let ((.cse0 (select |v_#memory_int_4194| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_4194| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:58,938 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-05-15 10:40:58,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:58,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:58,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:58,958 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:58,958 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4195|]. (let ((.cse0 (select |v_#memory_int_4195| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4195| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 1))) [2019-05-15 10:40:58,959 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 2) [2019-05-15 10:40:58,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:58,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:58,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:58,981 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:58,981 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4196|]. (let ((.cse0 (select |v_#memory_int_4196| ULTIMATE.start_main_p1))) (and (= .cse0 2) (= |#memory_int| (store |v_#memory_int_4196| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:58,981 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 3) [2019-05-15 10:40:58,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:58,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:58,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:58,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,003 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,004 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4197|]. (let ((.cse0 (select |v_#memory_int_4197| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4197| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 3))) [2019-05-15 10:40:59,004 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 4) [2019-05-15 10:40:59,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,027 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,027 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4198|]. (let ((.cse0 (select |v_#memory_int_4198| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4198| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 4))) [2019-05-15 10:40:59,027 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 5) [2019-05-15 10:40:59,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,050 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,050 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4199|]. (let ((.cse0 (select |v_#memory_int_4199| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4199| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 5))) [2019-05-15 10:40:59,051 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 6) [2019-05-15 10:40:59,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,074 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,075 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4200|]. (let ((.cse0 (select |v_#memory_int_4200| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4200| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 6 .cse0))) [2019-05-15 10:40:59,075 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 7) [2019-05-15 10:40:59,091 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4201|]. (let ((.cse0 (select |v_#memory_int_4201| ULTIMATE.start_main_p1))) (and (= .cse0 7) (= |#memory_int| (store |v_#memory_int_4201| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:59,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 8) [2019-05-15 10:40:59,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,127 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,127 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4202|]. (let ((.cse0 (select |v_#memory_int_4202| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4202| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 8))) [2019-05-15 10:40:59,127 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 9) [2019-05-15 10:40:59,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,152 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,152 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4203|]. (let ((.cse0 (select |v_#memory_int_4203| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4203| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 9))) [2019-05-15 10:40:59,153 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 10) [2019-05-15 10:40:59,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,180 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,180 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4204|]. (let ((.cse0 (select |v_#memory_int_4204| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4204| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 10 .cse0))) [2019-05-15 10:40:59,180 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 11) [2019-05-15 10:40:59,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,209 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,209 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4205|]. (let ((.cse0 (select |v_#memory_int_4205| ULTIMATE.start_main_p1))) (and (= .cse0 11) (= (store |v_#memory_int_4205| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,209 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 12) [2019-05-15 10:40:59,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,240 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,240 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4206|]. (let ((.cse0 (select |v_#memory_int_4206| ULTIMATE.start_main_p1))) (and (= 12 .cse0) (= |#memory_int| (store |v_#memory_int_4206| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:59,240 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 13) [2019-05-15 10:40:59,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,268 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,269 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4207|]. (let ((.cse0 (select |v_#memory_int_4207| ULTIMATE.start_main_p1))) (and (= .cse0 13) (= (store |v_#memory_int_4207| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,269 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 14) [2019-05-15 10:40:59,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,299 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,299 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4208|]. (let ((.cse0 (select |v_#memory_int_4208| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4208| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 14))) [2019-05-15 10:40:59,300 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 15) [2019-05-15 10:40:59,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,330 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,330 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4209|]. (let ((.cse0 (select |v_#memory_int_4209| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4209| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 15 .cse0))) [2019-05-15 10:40:59,330 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 16) [2019-05-15 10:40:59,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,366 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,366 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4210|]. (let ((.cse0 (select |v_#memory_int_4210| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4210| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 16 .cse0))) [2019-05-15 10:40:59,366 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 17) [2019-05-15 10:40:59,389 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,400 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,400 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4211|]. (let ((.cse0 (select |v_#memory_int_4211| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4211| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 17))) [2019-05-15 10:40:59,400 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 18) [2019-05-15 10:40:59,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,441 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,441 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4212|]. (let ((.cse0 (select |v_#memory_int_4212| ULTIMATE.start_main_p1))) (and (= 18 .cse0) (= |#memory_int| (store |v_#memory_int_4212| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:59,441 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 19) [2019-05-15 10:40:59,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,476 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,476 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4213|]. (let ((.cse0 (select |v_#memory_int_4213| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4213| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 19 .cse0))) [2019-05-15 10:40:59,477 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 20) [2019-05-15 10:40:59,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,512 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,513 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4214|]. (let ((.cse0 (select |v_#memory_int_4214| ULTIMATE.start_main_p1))) (and (= .cse0 20) (= (store |v_#memory_int_4214| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,513 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 21) [2019-05-15 10:40:59,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,540 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,547 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,548 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4215|]. (let ((.cse0 (select |v_#memory_int_4215| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4215| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 21))) [2019-05-15 10:40:59,548 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 22) [2019-05-15 10:40:59,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,584 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,584 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4216|]. (let ((.cse0 (select |v_#memory_int_4216| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4216| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 22 .cse0))) [2019-05-15 10:40:59,584 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 23) [2019-05-15 10:40:59,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,621 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,621 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4217|]. (let ((.cse0 (select |v_#memory_int_4217| ULTIMATE.start_main_p1))) (and (= 23 .cse0) (= (store |v_#memory_int_4217| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,621 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 24) [2019-05-15 10:40:59,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,661 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,661 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4218|]. (let ((.cse0 (select |v_#memory_int_4218| ULTIMATE.start_main_p1))) (and (= 24 .cse0) (= (store |v_#memory_int_4218| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,661 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 25) [2019-05-15 10:40:59,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,699 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,699 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4219|]. (let ((.cse0 (select |v_#memory_int_4219| ULTIMATE.start_main_p1))) (and (= .cse0 25) (= (store |v_#memory_int_4219| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:40:59,699 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 26) [2019-05-15 10:40:59,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,736 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,736 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4220|]. (let ((.cse0 (select |v_#memory_int_4220| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4220| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 26))) [2019-05-15 10:40:59,737 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 27) [2019-05-15 10:40:59,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,777 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,778 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4221|]. (let ((.cse0 (select |v_#memory_int_4221| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4221| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 27))) [2019-05-15 10:40:59,778 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 28) [2019-05-15 10:40:59,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,818 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,818 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4222|]. (let ((.cse0 (select |v_#memory_int_4222| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4222| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 28))) [2019-05-15 10:40:59,819 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 29) [2019-05-15 10:40:59,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,859 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,859 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4223|]. (let ((.cse0 (select |v_#memory_int_4223| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4223| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 29))) [2019-05-15 10:40:59,860 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 30) [2019-05-15 10:40:59,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,904 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,904 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4224|]. (let ((.cse0 (select |v_#memory_int_4224| ULTIMATE.start_main_p1))) (and (= 30 .cse0) (= |#memory_int| (store |v_#memory_int_4224| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:59,904 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 31) [2019-05-15 10:40:59,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,945 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,946 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4225|]. (let ((.cse0 (select |v_#memory_int_4225| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4225| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 31))) [2019-05-15 10:40:59,946 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 32) [2019-05-15 10:40:59,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:40:59,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:40:59,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:40:59,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:40:59,999 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:40:59,999 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4226|]. (let ((.cse0 (select |v_#memory_int_4226| ULTIMATE.start_main_p1))) (and (= .cse0 32) (= |#memory_int| (store |v_#memory_int_4226| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:40:59,999 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 33) [2019-05-15 10:41:00,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,042 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,043 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4227|]. (let ((.cse0 (select |v_#memory_int_4227| ULTIMATE.start_main_p1))) (and (= .cse0 33) (= (store |v_#memory_int_4227| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,043 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 34) [2019-05-15 10:41:00,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,089 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,089 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4228|]. (let ((.cse0 (select |v_#memory_int_4228| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4228| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 34))) [2019-05-15 10:41:00,089 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 35) [2019-05-15 10:41:00,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,135 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,135 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4229|]. (let ((.cse0 (select |v_#memory_int_4229| ULTIMATE.start_main_p1))) (and (= .cse0 35) (= (store |v_#memory_int_4229| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,135 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 36) [2019-05-15 10:41:00,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,181 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,181 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4230|]. (let ((.cse0 (select |v_#memory_int_4230| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4230| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 36))) [2019-05-15 10:41:00,182 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 37) [2019-05-15 10:41:00,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,227 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,228 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4231|]. (let ((.cse0 (select |v_#memory_int_4231| ULTIMATE.start_main_p1))) (and (= .cse0 37) (= (store |v_#memory_int_4231| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,228 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 38) [2019-05-15 10:41:00,266 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,277 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,277 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4232|]. (let ((.cse0 (select |v_#memory_int_4232| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4232| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 38 .cse0))) [2019-05-15 10:41:00,277 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 39) [2019-05-15 10:41:00,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,325 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,325 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4233|]. (let ((.cse0 (select |v_#memory_int_4233| ULTIMATE.start_main_p1))) (and (= .cse0 39) (= |#memory_int| (store |v_#memory_int_4233| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:00,325 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 40) [2019-05-15 10:41:00,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,374 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,374 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4234|]. (let ((.cse0 (select |v_#memory_int_4234| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4234| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 40))) [2019-05-15 10:41:00,374 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 41) [2019-05-15 10:41:00,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,419 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,428 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,429 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4235|]. (let ((.cse0 (select |v_#memory_int_4235| ULTIMATE.start_main_p1))) (and (= .cse0 41) (= (store |v_#memory_int_4235| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,429 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 42) [2019-05-15 10:41:00,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,478 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,478 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4236|]. (let ((.cse0 (select |v_#memory_int_4236| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4236| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 42))) [2019-05-15 10:41:00,478 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 43) [2019-05-15 10:41:00,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,530 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4237|]. (let ((.cse0 (select |v_#memory_int_4237| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4237| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 43))) [2019-05-15 10:41:00,530 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 44) [2019-05-15 10:41:00,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,587 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,587 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4238|]. (let ((.cse0 (select |v_#memory_int_4238| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4238| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 44 .cse0))) [2019-05-15 10:41:00,587 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 45) [2019-05-15 10:41:00,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,638 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,638 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4239|]. (let ((.cse0 (select |v_#memory_int_4239| ULTIMATE.start_main_p1))) (and (= .cse0 45) (= (store |v_#memory_int_4239| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,638 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 46) [2019-05-15 10:41:00,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,691 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,691 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4240|]. (let ((.cse0 (select |v_#memory_int_4240| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4240| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 46))) [2019-05-15 10:41:00,691 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 47) [2019-05-15 10:41:00,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,746 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,747 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4241|]. (let ((.cse0 (select |v_#memory_int_4241| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4241| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 47))) [2019-05-15 10:41:00,747 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 48) [2019-05-15 10:41:00,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,801 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,801 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4242|]. (let ((.cse0 (select |v_#memory_int_4242| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4242| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 48))) [2019-05-15 10:41:00,801 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 49) [2019-05-15 10:41:00,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,857 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,857 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4243|]. (let ((.cse0 (select |v_#memory_int_4243| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4243| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 49 .cse0))) [2019-05-15 10:41:00,857 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 50) [2019-05-15 10:41:00,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,915 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,915 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4244|]. (let ((.cse0 (select |v_#memory_int_4244| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4244| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 50 .cse0))) [2019-05-15 10:41:00,915 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 51) [2019-05-15 10:41:00,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:00,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:00,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:00,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:00,976 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:00,976 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4245|]. (let ((.cse0 (select |v_#memory_int_4245| ULTIMATE.start_main_p1))) (and (= 51 .cse0) (= (store |v_#memory_int_4245| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:00,976 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 52) [2019-05-15 10:41:01,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,035 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,035 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4246|]. (let ((.cse0 (select |v_#memory_int_4246| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4246| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 52 .cse0))) [2019-05-15 10:41:01,035 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 53) [2019-05-15 10:41:01,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,101 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,101 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4247|]. (let ((.cse0 (select |v_#memory_int_4247| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4247| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 53))) [2019-05-15 10:41:01,101 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 54) [2019-05-15 10:41:01,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,162 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,163 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4248|]. (let ((.cse0 (select |v_#memory_int_4248| ULTIMATE.start_main_p1))) (and (= .cse0 54) (= (store |v_#memory_int_4248| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:01,163 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 55) [2019-05-15 10:41:01,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,221 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,221 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4249|]. (let ((.cse0 (select |v_#memory_int_4249| ULTIMATE.start_main_p1))) (and (= 55 .cse0) (= (store |v_#memory_int_4249| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:01,221 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 56) [2019-05-15 10:41:01,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,281 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,281 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4250|]. (let ((.cse0 (select |v_#memory_int_4250| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4250| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 56 .cse0))) [2019-05-15 10:41:01,281 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 57) [2019-05-15 10:41:01,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,343 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,343 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4251|]. (let ((.cse0 (select |v_#memory_int_4251| ULTIMATE.start_main_p1))) (and (= 57 .cse0) (= (store |v_#memory_int_4251| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:01,344 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 58) [2019-05-15 10:41:01,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,404 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,405 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4252|]. (let ((.cse0 (select |v_#memory_int_4252| ULTIMATE.start_main_p1))) (and (= 58 .cse0) (= |#memory_int| (store |v_#memory_int_4252| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:01,405 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 59) [2019-05-15 10:41:01,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,470 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,471 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4253|]. (let ((.cse0 (select |v_#memory_int_4253| ULTIMATE.start_main_p1))) (and (= .cse0 59) (= (store |v_#memory_int_4253| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:01,471 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 60) [2019-05-15 10:41:01,522 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,532 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,533 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4254|]. (let ((.cse0 (select |v_#memory_int_4254| ULTIMATE.start_main_p1))) (and (= .cse0 60) (= |#memory_int| (store |v_#memory_int_4254| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:01,533 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 61) [2019-05-15 10:41:01,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,599 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,600 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4255|]. (let ((.cse0 (select |v_#memory_int_4255| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4255| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 61 .cse0))) [2019-05-15 10:41:01,600 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 62) [2019-05-15 10:41:01,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,663 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,664 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4256|]. (let ((.cse0 (select |v_#memory_int_4256| ULTIMATE.start_main_p1))) (and (= .cse0 62) (= |#memory_int| (store |v_#memory_int_4256| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:01,664 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 63) [2019-05-15 10:41:01,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,731 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,731 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4257|]. (let ((.cse0 (select |v_#memory_int_4257| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4257| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 63 .cse0))) [2019-05-15 10:41:01,731 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 64) [2019-05-15 10:41:01,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,804 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,805 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4258|]. (let ((.cse0 (select |v_#memory_int_4258| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4258| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 64 .cse0))) [2019-05-15 10:41:01,805 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 65) [2019-05-15 10:41:01,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,872 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,872 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4259|]. (let ((.cse0 (select |v_#memory_int_4259| ULTIMATE.start_main_p1))) (and (= 65 .cse0) (= |#memory_int| (store |v_#memory_int_4259| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:01,872 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 66) [2019-05-15 10:41:01,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:01,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:01,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:01,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:01,940 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:01,940 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4260|]. (let ((.cse0 (select |v_#memory_int_4260| ULTIMATE.start_main_p1))) (and (= 66 .cse0) (= (store |v_#memory_int_4260| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:01,940 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 67) [2019-05-15 10:41:02,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,013 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,014 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4261|]. (let ((.cse0 (select |v_#memory_int_4261| ULTIMATE.start_main_p1))) (and (= .cse0 67) (= |#memory_int| (store |v_#memory_int_4261| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:02,014 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 68) [2019-05-15 10:41:02,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,086 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,086 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4262|]. (let ((.cse0 (select |v_#memory_int_4262| ULTIMATE.start_main_p1))) (and (= 68 .cse0) (= |#memory_int| (store |v_#memory_int_4262| ULTIMATE.start_main_p1 (+ .cse0 1))))) [2019-05-15 10:41:02,086 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 69) [2019-05-15 10:41:02,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,157 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,158 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4263|]. (let ((.cse0 (select |v_#memory_int_4263| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4263| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 69))) [2019-05-15 10:41:02,158 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 70) [2019-05-15 10:41:02,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,233 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,233 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4264|]. (let ((.cse0 (select |v_#memory_int_4264| ULTIMATE.start_main_p1))) (and (= 70 .cse0) (= (store |v_#memory_int_4264| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-05-15 10:41:02,233 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 71) [2019-05-15 10:41:02,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,305 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,305 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4265|]. (let ((.cse0 (select |v_#memory_int_4265| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4265| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 71 .cse0))) [2019-05-15 10:41:02,305 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 72) [2019-05-15 10:41:02,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,375 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,375 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4266|]. (let ((.cse0 (select |v_#memory_int_4266| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4266| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 72 .cse0))) [2019-05-15 10:41:02,376 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 73) [2019-05-15 10:41:02,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,456 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,456 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4267|]. (let ((.cse0 (select |v_#memory_int_4267| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4267| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 73))) [2019-05-15 10:41:02,457 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 74) [2019-05-15 10:41:02,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,529 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,529 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4268|]. (let ((.cse0 (select |v_#memory_int_4268| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_4268| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 74))) [2019-05-15 10:41:02,529 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 75) [2019-05-15 10:41:02,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-05-15 10:41:02,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:41:02,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:41:02,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-05-15 10:41:02,602 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:41:02,602 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_4269|]. (let ((.cse0 (select |v_#memory_int_4269| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_4269| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 75 .cse0))) [2019-05-15 10:41:02,602 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 76)