NO

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l5
      0: l0 -> l1 : __disjvr_0^0'=__disjvr_0^post_1, x^0'=x^post_1, y^0'=y^post_1, [ __disjvr_0^0==__disjvr_0^post_1 && x^0==x^post_1 && y^0==y^post_1 ], cost: 1
      1: l1 -> l3 : __disjvr_0^0'=__disjvr_0^post_2, x^0'=x^post_2, y^0'=y^post_2, [ 1<=x^0 && __disjvr_0^0==__disjvr_0^post_2 && x^0==x^post_2 && y^0==y^post_2 ], cost: 1
      2: l3 -> l4 : __disjvr_0^0'=__disjvr_0^post_3, x^0'=x^post_3, y^0'=y^post_3, [ __disjvr_0^post_3==__disjvr_0^0 && __disjvr_0^0==__disjvr_0^post_3 && x^0==x^post_3 && y^0==y^post_3 ], cost: 1
      3: l4 -> l2 : __disjvr_0^0'=__disjvr_0^post_4, x^0'=x^post_4, y^0'=y^post_4, [ x^post_4==x^0+y^0 && __disjvr_0^0==__disjvr_0^post_4 && y^0==y^post_4 ], cost: 1
      4: l2 -> l1 : __disjvr_0^0'=__disjvr_0^post_5, x^0'=x^post_5, y^0'=y^post_5, [ __disjvr_0^0==__disjvr_0^post_5 && x^0==x^post_5 && y^0==y^post_5 ], cost: 1
      5: l5 -> l0 : __disjvr_0^0'=__disjvr_0^post_6, x^0'=x^post_6, y^0'=y^post_6, [ __disjvr_0^0==__disjvr_0^post_6 && x^0==x^post_6 && y^0==y^post_6 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: l5 -> l0 : __disjvr_0^0'=__disjvr_0^post_6, x^0'=x^post_6, y^0'=y^post_6, [ __disjvr_0^0==__disjvr_0^post_6 && x^0==x^post_6 && y^0==y^post_6 ], cost: 1

Simplified all rules, resulting in:
   Start location: l5
      0: l0 -> l1 : [], cost: 1
      1: l1 -> l3 : [ 1<=x^0 ], cost: 1
      2: l3 -> l4 : [], cost: 1
      3: l4 -> l2 : x^0'=x^0+y^0, [], cost: 1
      4: l2 -> l1 : [], cost: 1
      5: l5 -> l0 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l5
      9: l1 -> l1 : x^0'=x^0+y^0, [ 1<=x^0 ], cost: 4
      6: l5 -> l1 : [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      9: l1 -> l1 : x^0'=x^0+y^0, [ 1<=x^0 ], cost: 4

[test] deduced pseudo-invariant -y^0<=0, also trying y^0<=-1
   Accelerated rule 9 with non-termination, yielding the new rule 10.
   Accelerated rule 9 with non-termination, yielding the new rule 11.
   Accelerated rule 9 with backward acceleration, yielding the new rule 12.
   Accelerated rule 9 with backward acceleration, yielding the new rule 13.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Also removing duplicate rules: 11.

Accelerated all simple loops using metering functions (where possible):
   Start location: l5
      9: l1 -> l1 : x^0'=x^0+y^0, [ 1<=x^0 ], cost: 4
     10: l1 -> [6] : [ x^0==1 && y^0==0 ], cost: NONTERM
     12: l1 -> [6] : [ 1<=x^0 && -y^0<=0 ], cost: NONTERM
     13: l1 -> l1 : x^0'=x^0+k*y^0, [ y^0<=-1 && k>=0 && 1<=y^0*(-1+k)+x^0 ], cost: 4*k
      6: l5 -> l1 : [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l5
      6: l5 -> l1 : [], cost: 2
     14: l5 -> l1 : x^0'=x^0+y^0, [ 1<=x^0 ], cost: 6
     15: l5 -> [6] : [ x^0==1 && y^0==0 ], cost: NONTERM
     16: l5 -> [6] : [ 1<=x^0 && -y^0<=0 ], cost: NONTERM
     17: l5 -> l1 : x^0'=x^0+k*y^0, [ y^0<=-1 && k>=0 && 1<=y^0*(-1+k)+x^0 ], cost: 2+4*k

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l5
     15: l5 -> [6] : [ x^0==1 && y^0==0 ], cost: NONTERM
     16: l5 -> [6] : [ 1<=x^0 && -y^0<=0 ], cost: NONTERM
     17: l5 -> l1 : x^0'=x^0+k*y^0, [ y^0<=-1 && k>=0 && 1<=y^0*(-1+k)+x^0 ], cost: 2+4*k

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l5
     15: l5 -> [6] : [ x^0==1 && y^0==0 ], cost: NONTERM
     16: l5 -> [6] : [ 1<=x^0 && -y^0<=0 ], cost: NONTERM
     17: l5 -> l1 : x^0'=x^0+k*y^0, [ y^0<=-1 && k>=0 && 1<=y^0*(-1+k)+x^0 ], cost: 2+4*k

Computing asymptotic complexity for rule 15
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ x^0==1 && y^0==0 ]

NO