WORST_CASE(Omega(1),?)

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

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

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: l6 -> l5 : j^0'=j^post_8, [ j^0==j^post_8 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      3: l2 -> l3 : j^0'=j^post_4, [ 1+j^0<=2 && j^post_4==1+j^0 ], cost: 1
      4: l3 -> l2 : j^0'=j^post_5, [ j^0==j^post_5 ], cost: 1
      6: l5 -> l3 : j^0'=j^post_7, [ j^post_7==0 ], cost: 1
      7: l6 -> l5 : j^0'=j^post_8, [ j^0==j^post_8 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      3: l2 -> l3 : j^0'=1+j^0, [ 1+j^0<=2 ], cost: 1
      4: l3 -> l2 : [], cost: 1
      6: l5 -> l3 : j^0'=0, [], cost: 1
      7: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      9: l3 -> l3 : j^0'=1+j^0, [ 1+j^0<=2 ], cost: 2
      8: l6 -> l3 : j^0'=0, [], cost: 2

Accelerating simple loops of location 3.
   Accelerating the following rules:
      9: l3 -> l3 : j^0'=1+j^0, [ 1+j^0<=2 ], cost: 2

   Accelerated rule 9 with backward acceleration, yielding the new rule 10.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     10: l3 -> l3 : j^0'=2, [ 2-j^0>=0 ], cost: 4-2*j^0
      8: l6 -> l3 : j^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      8: l6 -> l3 : j^0'=0, [], cost: 2
     11: l6 -> l3 : j^0'=2, [], cost: 6

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     <empty>

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ j^0==j^post_8 ]

WORST_CASE(Omega(1),?)