WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : i^0'=i^post0, tmp13^0'=tmp13^post0, tmp___014^0'=tmp___014^post0, tmp10^0'=tmp10^post0, tmp___011^0'=tmp___011^post0, (-i^40+tmp___014^post0 == 0 /\ -i^30+tmp13^post0 == 0 /\ -1-i^30+i^40 == 0 /\ -1-i^40+i^post0 == 0 /\ -i^10+tmp10^post0 == 0 /\ tmp___011^post0-i^20 == 0 /\ -1+i^20-i^10 == 0 /\ i^10 == 0 /\ -1+i^30-i^20 == 0), cost: 1
   1: l2 -> l0 : i^0'=i^post1, tmp13^0'=tmp13^post1, tmp___014^0'=tmp___014^post1, tmp10^0'=tmp10^post1, tmp___011^0'=tmp___011^post1, (-tmp___014^post1+tmp___014^0 == 0 /\ tmp___011^0-tmp___011^post1 == 0 /\ i^0-i^post1 == 0 /\ -tmp10^post1+tmp10^0 == 0 /\ tmp13^0-tmp13^post1 == 0), cost: 1


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


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0