NO

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

Initial linear ITS problem
   Start location: l3
      0: l0 -> l1 : __const_100^0'=__const_100^post_1, __const_200^0'=__const_200^post_1, __const_300^0'=__const_300^post_1, __const_400^0'=__const_400^post_1, x^0'=x^post_1, [ x^post_1==x^0+__const_300^0 && 1+__const_100^0<=x^post_1 && __const_100^0==__const_100^post_1 && __const_200^0==__const_200^post_1 && __const_300^0==__const_300^post_1 && __const_400^0==__const_400^post_1 ], cost: 1
      1: l1 -> l0 : __const_100^0'=__const_100^post_2, __const_200^0'=__const_200^post_2, __const_300^0'=__const_300^post_2, __const_400^0'=__const_400^post_2, x^0'=x^post_2, [ x^post_2==x^0+__const_400^0 && 1+__const_100^0<=x^post_2 && __const_100^0==__const_100^post_2 && __const_200^0==__const_200^post_2 && __const_300^0==__const_300^post_2 && __const_400^0==__const_400^post_2 ], cost: 1
      2: l2 -> l0 : __const_100^0'=__const_100^post_3, __const_200^0'=__const_200^post_3, __const_300^0'=__const_300^post_3, __const_400^0'=__const_400^post_3, x^0'=x^post_3, [ x^post_3==x^0+__const_200^0 && 1+__const_100^0<=x^post_3 && __const_100^0==__const_100^post_3 && __const_200^0==__const_200^post_3 && __const_300^0==__const_300^post_3 && __const_400^0==__const_400^post_3 ], cost: 1
      3: l2 -> l1 : __const_100^0'=__const_100^post_4, __const_200^0'=__const_200^post_4, __const_300^0'=__const_300^post_4, __const_400^0'=__const_400^post_4, x^0'=x^post_4, [ x^post_4==x^0+__const_100^0 && 1+__const_100^0<=x^post_4 && __const_100^0==__const_100^post_4 && __const_200^0==__const_200^post_4 && __const_300^0==__const_300^post_4 && __const_400^0==__const_400^post_4 ], cost: 1
      4: l3 -> l2 : __const_100^0'=__const_100^post_5, __const_200^0'=__const_200^post_5, __const_300^0'=__const_300^post_5, __const_400^0'=__const_400^post_5, x^0'=x^post_5, [ __const_100^0==__const_100^post_5 && __const_200^0==__const_200^post_5 && __const_300^0==__const_300^post_5 && __const_400^0==__const_400^post_5 && x^0==x^post_5 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      4: l3 -> l2 : __const_100^0'=__const_100^post_5, __const_200^0'=__const_200^post_5, __const_300^0'=__const_300^post_5, __const_400^0'=__const_400^post_5, x^0'=x^post_5, [ __const_100^0==__const_100^post_5 && __const_200^0==__const_200^post_5 && __const_300^0==__const_300^post_5 && __const_400^0==__const_400^post_5 && x^0==x^post_5 ], cost: 1

Simplified all rules, resulting in:
   Start location: l3
      0: l0 -> l1 : x^0'=x^0+__const_300^0, [ 1+__const_100^0<=x^0+__const_300^0 ], cost: 1
      1: l1 -> l0 : x^0'=x^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_400^0 ], cost: 1
      2: l2 -> l0 : x^0'=x^0+__const_200^0, [ 1+__const_100^0<=x^0+__const_200^0 ], cost: 1
      3: l2 -> l1 : x^0'=x^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 ], cost: 1
      4: l3 -> l2 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on tree-shaped paths):
   Start location: l3
      0: l0 -> l1 : x^0'=x^0+__const_300^0, [ 1+__const_100^0<=x^0+__const_300^0 ], cost: 1
      1: l1 -> l0 : x^0'=x^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_400^0 ], cost: 1
      5: l3 -> l0 : x^0'=x^0+__const_200^0, [ 1+__const_100^0<=x^0+__const_200^0 ], cost: 2
      6: l3 -> l1 : x^0'=x^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 ], cost: 2

Eliminated location l0 (as a last resort):
   Start location: l3
      7: l1 -> l1 : x^0'=x^0+__const_300^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_400^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0 ], cost: 2
      6: l3 -> l1 : x^0'=x^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 ], cost: 2
      8: l3 -> l1 : x^0'=x^0+__const_200^0+__const_300^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 ], cost: 3

Accelerating simple loops of location 1.
   Accelerating the following rules:
      7: l1 -> l1 : x^0'=x^0+__const_300^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_400^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: l3
      7: l1 -> l1 : x^0'=x^0+__const_300^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_400^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0 ], cost: 2
      9: l1 -> [4] : [ 1+__const_100^0<=x^0+__const_400^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0 && x^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     11: l1 -> [4] : [ 1+__const_100^0<=x^0+__const_400^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     12: l1 -> l1 : x^0'=k*__const_300^0+x^0+k*__const_400^0, [ __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_400^0+(-1+k)*__const_300^0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0 ], cost: 2*k
      6: l3 -> l1 : x^0'=x^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 ], cost: 2
      8: l3 -> l1 : x^0'=x^0+__const_200^0+__const_300^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 ], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: l3
      6: l3 -> l1 : x^0'=x^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 ], cost: 2
      8: l3 -> l1 : x^0'=x^0+__const_200^0+__const_300^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 ], cost: 3
     13: l3 -> l1 : x^0'=x^0+__const_300^0+__const_400^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 ], cost: 4
     14: l3 -> l1 : x^0'=x^0+__const_200^0+2*__const_300^0+__const_400^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 ], cost: 5
     15: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && x^0+__const_100^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     16: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && x^0+__const_200^0+__const_300^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     17: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     18: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     19: l3 -> l1 : x^0'=k*__const_300^0+x^0+k*__const_400^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 ], cost: 2+2*k
     20: l3 -> l1 : x^0'=k*__const_300^0+x^0+__const_200^0+__const_300^0+k*__const_400^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+2*__const_300^0+__const_400^0+(-1+k)*__const_300^0 ], cost: 3+2*k

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l3
     15: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && x^0+__const_100^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     16: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && x^0+__const_200^0+__const_300^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     17: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     18: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     19: l3 -> l1 : x^0'=k*__const_300^0+x^0+k*__const_400^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 ], cost: 2+2*k
     20: l3 -> l1 : x^0'=k*__const_300^0+x^0+__const_200^0+__const_300^0+k*__const_400^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+2*__const_300^0+__const_400^0+(-1+k)*__const_300^0 ], cost: 3+2*k

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l3
     15: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && x^0+__const_100^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     16: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && x^0+__const_200^0+__const_300^0==1 && __const_300^0==0 && __const_400^0==0 && __const_100^0==0 ], cost: NONTERM
     17: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     18: l3 -> [4] : [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0+__const_400^0 && 1+__const_100^0<=x^0+__const_200^0+2*__const_300^0+__const_400^0 && -__const_300^0-__const_400^0<=0 ], cost: NONTERM
     19: l3 -> l1 : x^0'=k*__const_300^0+x^0+k*__const_400^0+__const_100^0, [ 1+__const_100^0<=x^0+__const_100^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 && 1+__const_100^0<=x^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0+__const_100^0 ], cost: 2+2*k
     20: l3 -> l1 : x^0'=k*__const_300^0+x^0+__const_200^0+__const_300^0+k*__const_400^0, [ 1+__const_100^0<=x^0+__const_200^0 && 1+__const_100^0<=x^0+__const_200^0+__const_300^0 && __const_300^0+__const_400^0<=-1 && k>=0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+__const_300^0+__const_400^0+(-1+k)*__const_300^0 && 1+__const_100^0<=x^0+__const_200^0+(-1+k)*__const_400^0+2*__const_300^0+__const_400^0+(-1+k)*__const_300^0 ], cost: 3+2*k

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:  [ 1+__const_100^0<=x^0+__const_100^0 && 1+__const_100^0<=x^0+__const_400^0+__const_100^0 && 1+__const_100^0<=x^0+__const_300^0+__const_400^0+__const_100^0 && -__const_300^0-__const_400^0<=0 ]

NO