WORST_CASE(Omega(0),?)

Initial ITS
Start location: l6
   0: l0 -> l1 : a^0'=a^post0, tmp^0'=tmp^post0, ret_returnOne3^0'=ret_returnOne3^post0, (3-a^0 <= 0 /\ a^0-a^post0 == 0 /\ tmp^0-tmp^post0 == 0 /\ -ret_returnOne3^post0+ret_returnOne3^0 == 0), cost: 1
   1: l0 -> l1 : a^0'=a^post1, tmp^0'=tmp^post1, ret_returnOne3^0'=ret_returnOne3^post1, (-1+a^0 <= 0 /\ tmp^0-tmp^post1 == 0 /\ a^0-a^post1 == 0 /\ ret_returnOne3^0-ret_returnOne3^post1 == 0), cost: 1
   2: l0 -> l2 : a^0'=a^post2, tmp^0'=tmp^post2, ret_returnOne3^0'=ret_returnOne3^post2, (2-a^0 <= 0 /\ ret_returnOne3^0-ret_returnOne3^post2 == 0 /\ -1+tmp^post2 == 0 /\ a^0-a^post2 == 0 /\ -2+a^0 <= 0), cost: 1
   7: l1 -> l2 : a^0'=a^post7, tmp^0'=tmp^post7, ret_returnOne3^0'=ret_returnOne3^post7, (tmp^post7 == 0 /\ ret_returnOne3^0-ret_returnOne3^post7 == 0 /\ a^0-a^post7 == 0), cost: 1
   3: l2 -> l3 : a^0'=a^post3, tmp^0'=tmp^post3, ret_returnOne3^0'=ret_returnOne3^post3, (ret_returnOne3^0-ret_returnOne3^post3 == 0 /\ a^0-a^post3 == 0 /\ tmp^0-tmp^post3 == 0), cost: 1
   4: l4 -> l0 : a^0'=a^post4, tmp^0'=tmp^post4, ret_returnOne3^0'=ret_returnOne3^post4, (2-a^0 <= 0 /\ tmp^0-tmp^post4 == 0 /\ ret_returnOne3^0-ret_returnOne3^post4 == 0 /\ a^0-a^post4 == 0), cost: 1
   5: l4 -> l0 : a^0'=a^post5, tmp^0'=tmp^post5, ret_returnOne3^0'=ret_returnOne3^post5, (a^0 <= 0 /\ a^0-a^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ ret_returnOne3^0-ret_returnOne3^post5 == 0), cost: 1
   6: l4 -> l2 : a^0'=a^post6, tmp^0'=tmp^post6, ret_returnOne3^0'=ret_returnOne3^post6, (ret_returnOne3^0-ret_returnOne3^post6 == 0 /\ 1-a^0 <= 0 /\ -1+a^0 <= 0 /\ -1+tmp^post6 == 0 /\ a^0-a^post6 == 0), cost: 1
   8: l5 -> l4 : a^0'=a^post8, tmp^0'=tmp^post8, ret_returnOne3^0'=ret_returnOne3^post8, (1+a^10 == 0 /\ -ret_returnOne3^post8+a^post8 == 0 /\ -1+ret_returnOne3^post8 == 0 /\ tmp^0-tmp^post8 == 0), cost: 1
   9: l6 -> l5 : a^0'=a^post9, tmp^0'=tmp^post9, ret_returnOne3^0'=ret_returnOne3^post9, (-tmp^post9+tmp^0 == 0 /\ a^0-a^post9 == 0 /\ -ret_returnOne3^post9+ret_returnOne3^0 == 0), cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0