WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l2
      0: l0 -> l1 : i^0'=i^post_1, tmp10^0'=tmp10^post_1, tmp13^0'=tmp13^post_1, tmp___011^0'=tmp___011^post_1, tmp___014^0'=tmp___014^post_1, [ i^1_1==0 && tmp10^post_1==i^1_1 && i^2_1==1+i^1_1 && tmp___011^post_1==i^2_1 && i^3_1==1+i^2_1 && tmp13^post_1==i^3_1 && i^4_1==1+i^3_1 && tmp___014^post_1==i^4_1 && i^post_1==1+i^4_1 ], cost: 1
      1: l2 -> l0 : i^0'=i^post_2, tmp10^0'=tmp10^post_2, tmp13^0'=tmp13^post_2, tmp___011^0'=tmp___011^post_2, tmp___014^0'=tmp___014^post_2, [ i^0==i^post_2 && tmp10^0==tmp10^post_2 && tmp13^0==tmp13^post_2 && tmp___011^0==tmp___011^post_2 && tmp___014^0==tmp___014^post_2 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      1: l2 -> l0 : i^0'=i^post_2, tmp10^0'=tmp10^post_2, tmp13^0'=tmp13^post_2, tmp___011^0'=tmp___011^post_2, tmp___014^0'=tmp___014^post_2, [ i^0==i^post_2 && tmp10^0==tmp10^post_2 && tmp13^0==tmp13^post_2 && tmp___011^0==tmp___011^post_2 && tmp___014^0==tmp___014^post_2 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l2
     <empty>

Empty problem, aborting

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:  [ i^0==i^post_2 && tmp10^0==tmp10^post_2 && tmp13^0==tmp13^post_2 && tmp___011^0==tmp___011^post_2 && tmp___014^0==tmp___014^post_2 ]

WORST_CASE(Omega(1),?)