java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:57:58,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:57:58,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:57:58,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:57:58,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:57:58,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:57:58,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:57:58,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:57:58,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:57:58,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:57:58,443 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:57:58,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:57:58,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:57:58,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:57:58,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:57:58,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:57:58,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:57:58,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:57:58,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:57:58,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:57:58,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:57:58,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:57:58,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:57:58,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:57:58,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:57:58,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:57:58,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:57:58,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:57:58,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:57:58,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:57:58,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:57:58,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:57:58,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:57:58,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:57:58,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:57:58,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:57:58,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:57:58,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:57:58,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:57:58,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:57:58,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:57:58,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:57:58,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:57:58,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:57:58,516 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:57:58,516 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:57:58,517 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl [2019-08-05 10:57:58,517 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl' [2019-08-05 10:57:58,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:58,592 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:58,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:58,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:58,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:58,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:58,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:58,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:58,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:58,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/1) ... [2019-08-05 10:57:58,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:58,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:58,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:58,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:58,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (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-08-05 10:57:58,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:58,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:59,210 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:57:59,413 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:59,414 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:59,415 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:59 BoogieIcfgContainer [2019-08-05 10:57:59,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:59,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:59,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:59,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:59,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:58" (1/2) ... [2019-08-05 10:57:59,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0877f9 and model type alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:59, skipping insertion in model container [2019-08-05 10:57:59,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:59" (2/2) ... [2019-08-05 10:57:59,425 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl [2019-08-05 10:57:59,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:59,444 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:59,461 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:59,487 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:59,488 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:59,488 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:59,489 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:59,489 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:59,489 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:59,489 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:59,489 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:59,490 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:57:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:57:59,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:59,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:57:59,516 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash 889539725, now seen corresponding path program 1 times [2019-08-05 10:57:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:59,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:57:59,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:59,725 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-08-05 10:57:59,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:59,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:59,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:59,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:57:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:59,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:57:59,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:59,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:59,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:59,851 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 10:58:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:00,182 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:58:00,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:58:00,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:58:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:00,197 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:58:00,197 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:58:00,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:58:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:58:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:58:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 10:58:00,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 10:58:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:00,230 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 10:58:00,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:58:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 10:58:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:58:00,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:00,231 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:00,231 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash 332065109, now seen corresponding path program 1 times [2019-08-05 10:58:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:00,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:58:00,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:00,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:00,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:00,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:00,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:00,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 10:58:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:00,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:58:00,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:58:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:58:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:58:00,590 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2019-08-05 10:58:00,898 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2019-08-05 10:58:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:00,957 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:58:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:58:00,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:58:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:00,958 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:58:00,958 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:58:00,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:58:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:58:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:58:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 10:58:00,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2019-08-05 10:58:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:00,964 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 10:58:00,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:58:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 10:58:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:58:00,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:00,965 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:00,965 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash 980899835, now seen corresponding path program 1 times [2019-08-05 10:58:00,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:01,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:58:01,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:01,243 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-08-05 10:58:01,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:01,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:11 [2019-08-05 10:58:01,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-08-05 10:58:01,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-08-05 10:58:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:01,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:01,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:58:01,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:58:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:58:01,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:01,542 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-08-05 10:58:02,079 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-08-05 10:58:02,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:02,303 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 10:58:02,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:58:02,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:58:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:02,305 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:58:02,305 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:58:02,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:58:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:58:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:58:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:58:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:58:02,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-08-05 10:58:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:02,312 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:58:02,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:58:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:58:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:58:02,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:02,313 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:58:02,313 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:02,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash -968163545, now seen corresponding path program 2 times [2019-08-05 10:58:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:02,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:58:02,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:02,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:02,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:02,595 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:28 [2019-08-05 10:58:02,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-08-05 10:58:02,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:02,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-08-05 10:58:02,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:02,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-08-05 10:58:02,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-08-05 10:58:02,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:02,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:02,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:02,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:42 [2019-08-05 10:58:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:58:02,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:58:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:58:02,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:58:02,963 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2019-08-05 10:58:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:03,207 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 10:58:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:58:03,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 10:58:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:03,209 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:58:03,209 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:58:03,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:58:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:58:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:58:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:58:03,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 10:58:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:03,213 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:58:03,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:58:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:58:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:58:03,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:03,214 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:58:03,215 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:03,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1149777855, now seen corresponding path program 3 times [2019-08-05 10:58:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:03,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:58:03,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:03,468 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-08-05 10:58:03,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:03,545 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:03,576 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:03,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 10:58:03,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,707 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-08-05 10:58:03,707 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.0 percent of original size [2019-08-05 10:58:03,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 10:58:03,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:03,799 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:03,856 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:03,893 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:03,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:03,912 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:82, output treesize:51 [2019-08-05 10:58:03,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-08-05 10:58:03,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,025 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-08-05 10:58:04,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-08-05 10:58:04,100 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,146 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:04,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-05 10:58:04,154 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-08-05 10:58:04,191 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:04,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 53 [2019-08-05 10:58:04,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:04,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:04,253 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:04,311 INFO L567 ElimStorePlain]: treesize reduction 51, result has 58.2 percent of original size [2019-08-05 10:58:04,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:04,313 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:122, output treesize:52 [2019-08-05 10:58:04,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-08-05 10:58:04,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:04,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:40 [2019-08-05 10:58:04,644 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:04,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:04,884 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-08-05 10:58:04,884 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:58:04,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 27 [2019-08-05 10:58:04,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:04,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2019-08-05 10:58:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:04,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:04,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:58:04,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:58:04,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:58:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:58:04,926 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-08-05 10:58:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:05,501 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-08-05 10:58:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:58:05,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 10:58:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:05,503 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:58:05,504 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:58:05,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:58:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:58:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2019-08-05 10:58:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:58:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 10:58:05,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2019-08-05 10:58:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:05,509 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 10:58:05,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:58:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 10:58:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:58:05,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:05,510 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:58:05,511 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash 412529371, now seen corresponding path program 4 times [2019-08-05 10:58:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:05,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-05 10:58:05,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:05,883 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-08-05 10:58:05,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,026 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:58:06,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:06,046 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:06,068 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|, |ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:06,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 10:58:06,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,152 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.3 percent of original size [2019-08-05 10:58:06,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-08-05 10:58:06,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 10:58:06,218 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,291 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.3 percent of original size [2019-08-05 10:58:06,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:06,300 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:06,342 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:06,374 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,401 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:99, output treesize:78 [2019-08-05 10:58:06,441 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:06,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:06,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-08-05 10:58:06,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,585 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-08-05 10:58:06,585 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.1 percent of original size [2019-08-05 10:58:06,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 10:58:06,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,751 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-08-05 10:58:06,752 INFO L567 ElimStorePlain]: treesize reduction 46, result has 77.6 percent of original size [2019-08-05 10:58:06,753 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|], 2=[|ULTIMATE.start_write~int_old_#memory_int|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:06,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-08-05 10:58:06,766 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 10:58:06,819 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,958 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-08-05 10:58:06,959 INFO L567 ElimStorePlain]: treesize reduction 10, result has 92.5 percent of original size [2019-08-05 10:58:06,965 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:06,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2019-08-05 10:58:06,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:06,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:06,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:06,980 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:07,109 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-08-05 10:58:07,110 INFO L567 ElimStorePlain]: treesize reduction 138, result has 45.5 percent of original size [2019-08-05 10:58:07,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:07,112 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:165, output treesize:130 [2019-08-05 10:58:07,315 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-08-05 10:58:07,325 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 10=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:07,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:07,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:07,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2019-08-05 10:58:07,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:07,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:07,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:07,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:07,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-08-05 10:58:07,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:07,618 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-08-05 10:58:07,619 INFO L567 ElimStorePlain]: treesize reduction 96, result has 68.0 percent of original size [2019-08-05 10:58:07,620 INFO L392 ElimStorePlain]: Different costs {2=[|ULTIMATE.start_write~int_old_#memory_int|], 6=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:07,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:07,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2019-08-05 10:58:07,665 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:07,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:07,713 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:07,755 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:07,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 136 [2019-08-05 10:58:07,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:07,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:07,759 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:07,852 INFO L567 ElimStorePlain]: treesize reduction 108, result has 60.9 percent of original size [2019-08-05 10:58:07,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:07,854 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:181, output treesize:144 [2019-08-05 10:58:07,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:08,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:08,222 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2019-08-05 10:58:08,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,498 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-08-05 10:58:08,498 INFO L567 ElimStorePlain]: treesize reduction 12, result has 92.1 percent of original size [2019-08-05 10:58:08,501 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_int|], 6=[|#memory_$Pointer$.base|]} [2019-08-05 10:58:08,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:08,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-08-05 10:58:08,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:08,579 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:08,591 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:58:08,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 44 [2019-08-05 10:58:08,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:08,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:08,594 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:08,677 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.9 percent of original size [2019-08-05 10:58:08,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:08,679 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:196, output treesize:45 [2019-08-05 10:58:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:08,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:08,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:58:08,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:58:08,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:58:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:08,752 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 12 states. [2019-08-05 10:58:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:09,965 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-08-05 10:58:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:58:09,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:58:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:09,966 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:58:09,966 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:58:09,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:58:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:58:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-08-05 10:58:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:58:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-08-05 10:58:09,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 18 [2019-08-05 10:58:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:09,972 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-08-05 10:58:09,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:58:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-08-05 10:58:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:58:09,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:09,973 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:58:09,973 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -665558751, now seen corresponding path program 5 times [2019-08-05 10:58:09,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:10,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:58:10,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:10,265 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:58:10,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:10,291 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:10,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 10:58:10,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,834 WARN L188 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-08-05 10:58:10,835 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.2 percent of original size [2019-08-05 10:58:10,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 10:58:10,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:10,881 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:10,912 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:10,959 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,980 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:51 [2019-08-05 10:58:11,068 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_write~int_old_#memory_int|], 2=[|ULTIMATE.start_write~int_old_#memory_$Pointer$.offset|, |ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:11,073 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-08-05 10:58:11,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-08-05 10:58:11,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:11,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 71 [2019-08-05 10:58:11,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,206 INFO L567 ElimStorePlain]: treesize reduction 20, result has 82.6 percent of original size [2019-08-05 10:58:11,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:11,207 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:122, output treesize:80 [2019-08-05 10:58:11,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2019-08-05 10:58:11,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:11,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:11,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:95, output treesize:78 [2019-08-05 10:58:11,359 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:11,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:11,649 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:58:11,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 75 [2019-08-05 10:58:11,651 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,654 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:11,801 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-08-05 10:58:11,801 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.7 percent of original size [2019-08-05 10:58:11,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:11,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2019-08-05 10:58:11,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:11,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,016 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 45 [2019-08-05 10:58:12,016 INFO L567 ElimStorePlain]: treesize reduction 114, result has 38.0 percent of original size [2019-08-05 10:58:12,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:12,019 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:159, output treesize:62 [2019-08-05 10:58:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:58:12,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:58:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:58:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:58:12,159 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2019-08-05 10:58:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:12,718 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-08-05 10:58:12,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:58:12,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-08-05 10:58:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:12,720 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:58:12,720 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:58:12,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:58:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:58:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:58:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:58:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 10:58:12,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2019-08-05 10:58:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:12,724 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 10:58:12,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:58:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 10:58:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:58:12,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:12,725 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:58:12,725 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:12,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1448780043, now seen corresponding path program 6 times [2019-08-05 10:58:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:13,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:58:13,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:13,190 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-08-05 10:58:13,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,333 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:58:13,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 10:58:13,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:13,431 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:13,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2019-08-05 10:58:13,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,513 INFO L567 ElimStorePlain]: treesize reduction 11, result has 85.7 percent of original size [2019-08-05 10:58:13,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,540 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 10:58:13,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,600 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.1 percent of original size [2019-08-05 10:58:13,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 10:58:13,607 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:58:13,639 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:13,661 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,661 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:65 [2019-08-05 10:58:13,845 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-08-05 10:58:13,848 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:13,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:13,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-08-05 10:58:13,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:13,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-08-05 10:58:14,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,159 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-08-05 10:58:14,160 INFO L567 ElimStorePlain]: treesize reduction 46, result has 77.9 percent of original size [2019-08-05 10:58:14,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2019-08-05 10:58:14,168 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,272 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-08-05 10:58:14,273 INFO L567 ElimStorePlain]: treesize reduction 10, result has 93.4 percent of original size [2019-08-05 10:58:14,294 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 91 [2019-08-05 10:58:14,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:14,297 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:14,405 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-08-05 10:58:14,405 INFO L567 ElimStorePlain]: treesize reduction 99, result has 57.3 percent of original size [2019-08-05 10:58:14,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:14,407 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:155, output treesize:165 [2019-08-05 10:58:14,578 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2019-08-05 10:58:14,583 INFO L392 ElimStorePlain]: Different costs {6=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 10=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:14,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 67 [2019-08-05 10:58:14,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,821 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-08-05 10:58:14,821 INFO L567 ElimStorePlain]: treesize reduction 16, result has 93.9 percent of original size [2019-08-05 10:58:14,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-08-05 10:58:14,895 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:15,265 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-08-05 10:58:15,265 INFO L567 ElimStorePlain]: treesize reduction 96, result has 73.7 percent of original size [2019-08-05 10:58:15,266 INFO L392 ElimStorePlain]: Different costs {6=[|ULTIMATE.start_write~int_old_#memory_int|], 12=[|ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base|]} [2019-08-05 10:58:15,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:15,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:15,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:15,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2019-08-05 10:58:15,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:15,472 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-08-05 10:58:15,473 INFO L567 ElimStorePlain]: treesize reduction 22, result has 91.4 percent of original size [2019-08-05 10:58:15,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:15,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:15,622 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-08-05 10:58:15,622 INFO L341 Elim1Store]: treesize reduction 8, result has 93.8 percent of original size [2019-08-05 10:58:15,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 187 [2019-08-05 10:58:15,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:15,625 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:15,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:15,638 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2019-08-05 10:58:16,069 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2019-08-05 10:58:16,070 INFO L567 ElimStorePlain]: treesize reduction 1679, result has 10.5 percent of original size [2019-08-05 10:58:16,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:16,072 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:256, output treesize:250 [2019-08-05 10:58:16,279 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-08-05 10:58:16,293 INFO L392 ElimStorePlain]: Different costs {10=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 21=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 10:58:16,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,356 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:16,356 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 115 [2019-08-05 10:58:16,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:16,697 WARN L188 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 92 [2019-08-05 10:58:16,697 INFO L567 ElimStorePlain]: treesize reduction 20, result has 93.6 percent of original size [2019-08-05 10:58:16,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:16,952 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-08-05 10:58:16,953 INFO L341 Elim1Store]: treesize reduction 62, result has 82.2 percent of original size [2019-08-05 10:58:16,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 67 treesize of output 309 [2019-08-05 10:58:16,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:17,430 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2019-08-05 10:58:17,431 INFO L567 ElimStorePlain]: treesize reduction 160, result has 67.7 percent of original size [2019-08-05 10:58:17,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:17,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:17,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:17,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:17,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 174 [2019-08-05 10:58:17,550 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:17,985 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 101 [2019-08-05 10:58:17,985 INFO L567 ElimStorePlain]: treesize reduction 102, result has 77.4 percent of original size [2019-08-05 10:58:18,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:18,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:58:18,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:18,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 258 treesize of output 211 [2019-08-05 10:58:18,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,085 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,086 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,088 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,090 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,092 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,138 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,139 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:58:18,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,151 INFO L496 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:18,829 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 115 [2019-08-05 10:58:18,830 INFO L567 ElimStorePlain]: treesize reduction 78, result has 73.6 percent of original size [2019-08-05 10:58:18,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,835 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:18,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,177 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-08-05 10:58:19,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:19,184 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:306, output treesize:239 [2019-08-05 10:58:19,185 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,186 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,193 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,471 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 81 [2019-08-05 10:58:19,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,479 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:19,883 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-08-05 10:58:20,106 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-08-05 10:58:20,216 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-08-05 10:58:20,429 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,432 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,434 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:20,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:21,643 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-08-05 10:58:21,747 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-08-05 10:58:21,977 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-08-05 10:58:21,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:21,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:22,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 337 [2019-08-05 10:58:22,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:22,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,257 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:22,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 369 treesize of output 509 [2019-08-05 10:58:22,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:22,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:22,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:22,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 399 [2019-08-05 10:58:22,382 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:22,475 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:22,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 358 [2019-08-05 10:58:22,477 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:23,954 WARN L188 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 283 DAG size of output: 242 [2019-08-05 10:58:23,955 INFO L567 ElimStorePlain]: treesize reduction 328, result has 79.0 percent of original size [2019-08-05 10:58:23,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,964 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,989 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:23,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,003 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,826 WARN L188 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-08-05 10:58:24,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,833 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-2 vars, End of recursive call: 32 dim-0 vars, and 4 xjuncts. [2019-08-05 10:58:24,837 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:1173, output treesize:1220 [2019-08-05 10:58:24,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,875 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,880 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,882 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:24,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,698 WARN L188 SmtUtils]: Spent 26.62 s on a formula simplification that was a NOOP. DAG size: 338 [2019-08-05 10:58:51,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,707 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,713 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,721 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,733 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:58:51,753 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:59:16,863 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 10:59:16,864 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:224) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:204) ... 46 more [2019-08-05 10:59:16,869 INFO L168 Benchmark]: Toolchain (without parser) took 78277.83 ms. Allocated memory was 140.5 MB in the beginning and 428.9 MB in the end (delta: 288.4 MB). Free memory was 109.4 MB in the beginning and 305.6 MB in the end (delta: -196.2 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:16,869 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:59:16,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.21 ms. Allocated memory is still 140.5 MB. Free memory was 109.4 MB in the beginning and 107.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:16,870 INFO L168 Benchmark]: Boogie Preprocessor took 52.40 ms. Allocated memory is still 140.5 MB. Free memory was 107.3 MB in the beginning and 106.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:16,870 INFO L168 Benchmark]: RCFGBuilder took 704.46 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 80.3 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:16,871 INFO L168 Benchmark]: TraceAbstraction took 77450.18 ms. Allocated memory was 140.5 MB in the beginning and 428.9 MB in the end (delta: 288.4 MB). Free memory was 80.3 MB in the beginning and 305.6 MB in the end (delta: -225.3 MB). Peak memory consumption was 289.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:16,873 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.21 ms. Allocated memory is still 140.5 MB. Free memory was 109.4 MB in the beginning and 107.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.40 ms. Allocated memory is still 140.5 MB. Free memory was 107.3 MB in the beginning and 106.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 704.46 ms. Allocated memory is still 140.5 MB. Free memory was 105.6 MB in the beginning and 80.3 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77450.18 ms. Allocated memory was 140.5 MB in the beginning and 428.9 MB in the end (delta: 288.4 MB). Free memory was 80.3 MB in the beginning and 305.6 MB in the end (delta: -225.3 MB). Peak memory consumption was 289.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...