WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : i^0'=i^post0, tmp^0'=tmp^post0, j^0'=j^post0, (i^0-i^post0 == 0 /\ tmp^0-tmp^post0 == 0 /\ -j^post0+j^0 == 0), cost: 1
   1: l0 -> l1 : i^0'=i^post1, tmp^0'=tmp^post1, j^0'=j^post1, (tmp^0-tmp^post1 == 0 /\ i^0-i^post1 == 0 /\ j^0-j^post1 == 0), cost: 1
   2: l1 -> l2 : i^0'=i^post2, tmp^0'=tmp^post2, j^0'=j^post2, (tmp^0-tmp^post2 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1
   3: l3 -> l0 : i^0'=i^post3, tmp^0'=tmp^post3, j^0'=j^post3, (0 == 0 /\ i^post3 == 0 /\ -1+j^post3 == 0), cost: 1
   4: l4 -> l3 : i^0'=i^post4, tmp^0'=tmp^post4, j^0'=j^post4, (tmp^0-tmp^post4 == 0 /\ j^0-j^post4 == 0 /\ i^0-i^post4 == 0), cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0