WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: [0]
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1
      1: [1] -> [2] : [ i<=exp ], cost: 1
      3: [1] -> [3] : [ i>exp ], cost: 1
      2: [2] -> [1] : i'=1+i, exp'=n*exp, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1

Removed unreachable and leaf rules:
   Start location: [0]
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1
      1: [1] -> [2] : [ i<=exp ], cost: 1
      2: [2] -> [1] : i'=1+i, exp'=n*exp, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: [0]
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1
      4: [1] -> [1] : i'=1+i, exp'=n*exp, [ i<=exp ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      4: [1] -> [1] : i'=1+i, exp'=n*exp, [ i<=exp ], cost: 2

   Failed to prove monotonicity of the guard of rule 4.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: [0]
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1
      4: [1] -> [1] : i'=1+i, exp'=n*exp, [ i<=exp ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: [0]
      0: [0] -> [1] : i'=1, exp'=1, [ n>=2 ], cost: 1
      5: [0] -> [1] : i'=2, exp'=n, [ n>=2 ], cost: 3

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

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: [0]
     <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:  [ n>=2 ]

WORST_CASE(Omega(1),?)