NO

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

Initial linear ITS problem
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      1: [1] -> [2] : [ x>=0 && y>=32 ], cost: 1
      5: [1] -> [4] : [ x<0 ], cost: 1
      2: [2] -> [3] : x'=1, y'=15, [], cost: 1
      3: [2] -> [3] : x'=nondet, y'=x, [], cost: 1
      4: [3] -> [1] : [ 0<=0 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      0: [0] -> [1] : [ x>=1 ], cost: 1

Removed unreachable and leaf rules:
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      1: [1] -> [2] : [ x>=0 && y>=32 ], cost: 1
      2: [2] -> [3] : x'=1, y'=15, [], cost: 1
      3: [2] -> [3] : x'=nondet, y'=x, [], cost: 1
      4: [3] -> [1] : [ 0<=0 ], cost: 1

Simplified all rules, resulting in:
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      1: [1] -> [2] : [ x>=0 && y>=32 ], cost: 1
      2: [2] -> [3] : x'=1, y'=15, [], cost: 1
      3: [2] -> [3] : x'=nondet, y'=x, [], cost: 1
      4: [3] -> [1] : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on tree-shaped paths):
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      6: [1] -> [3] : x'=1, y'=15, [ x>=0 && y>=32 ], cost: 2
      7: [1] -> [3] : x'=nondet, y'=x, [ x>=0 && y>=32 ], cost: 2
      4: [3] -> [1] : [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      8: [1] -> [1] : x'=1, y'=15, [ x>=0 && y>=32 ], cost: 3
      9: [1] -> [1] : x'=nondet, y'=x, [ x>=0 && y>=32 ], cost: 3

Accelerating simple loops of location 1.
   Accelerating the following rules:
      8: [1] -> [1] : x'=1, y'=15, [ x>=0 && y>=32 ], cost: 3
      9: [1] -> [1] : x'=nondet, y'=x, [ x>=0 && y>=32 ], cost: 3

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

Accelerated all simple loops using metering functions (where possible):
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
      9: [1] -> [1] : x'=nondet, y'=x, [ x>=0 && y>=32 ], cost: 3
     10: [1] -> [5] : [ x>=0 && y>=32 ], cost: NONTERM
     11: [1] -> [5] : [ x>=0 && y>=32 && nondet>=0 ], cost: NONTERM
     13: [1] -> [5] : [ x>=0 && y>=32 && -nondet+x<=0 ], cost: NONTERM

Chained accelerated rules (with incoming rules):
   Start location: [0]
      0: [0] -> [1] : [ x>=1 ], cost: 1
     14: [0] -> [1] : x'=nondet, y'=x, [ x>=1 && x>=0 && y>=32 ], cost: 4
     15: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM
     16: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM
     17: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: [0]
     15: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM
     16: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM
     17: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: [0]
     17: [0] -> [5] : [ x>=1 && x>=0 && y>=32 ], cost: NONTERM

Computing asymptotic complexity for rule 17
   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>=1 && x>=0 && y>=32 ]

NO