WORST_CASE(Omega(0),?)

Initial ITS
Start location: l5
   0: l0 -> l1 : __len9^0'=__len9^post0, tmp___1^0'=tmp___1^post0, tmp10^0'=tmp10^post0, tmp___0^0'=tmp___0^post0, __val8^0'=__val8^post0, tmp^0'=tmp^post0, (-tmp10^post0+tmp10^0 == 0 /\ -tmp^post0+tmp^0 == 0 /\ __len9^0-__len9^post0 == 0 /\ tmp___1^0-tmp___1^post0 == 0 /\ __val8^0-__val8^post0 == 0 /\ -tmp___0^post0+tmp___0^0 == 0), cost: 1
   1: l2 -> l0 : __len9^0'=__len9^post1, tmp___1^0'=tmp___1^post1, tmp10^0'=tmp10^post1, tmp___0^0'=tmp___0^post1, __val8^0'=__val8^post1, tmp^0'=tmp^post1, (0 == 0 /\ __val8^0-__val8^post1 == 0 /\ __len9^0-__len9^post1 == 0 /\ -tmp^post1+tmp^0 == 0 /\ tmp___1^0-tmp___1^post1 == 0 /\ -tmp10^post1+tmp10^0 == 0), cost: 1
   2: l3 -> l0 : __len9^0'=__len9^post2, tmp___1^0'=tmp___1^post2, tmp10^0'=tmp10^post2, tmp___0^0'=tmp___0^post2, __val8^0'=__val8^post2, tmp^0'=tmp^post2, (0 == 0 /\ -tmp___0^post2+tmp___0^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ tmp___1^0-tmp___1^post2 == 0 /\ __val8^post2 == 0 /\ 1+tmp___1^0 <= 0 /\ -1-tmp___1^0 <= 0), cost: 1
   3: l3 -> l2 : __len9^0'=__len9^post3, tmp___1^0'=tmp___1^post3, tmp10^0'=tmp10^post3, tmp___0^0'=tmp___0^post3, __val8^0'=__val8^post3, tmp^0'=tmp^post3, (-tmp^post3+tmp^0 == 0 /\ tmp___1^0-tmp___1^post3 == 0 /\ -tmp___1^0 <= 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ tmp10^0-tmp10^post3 == 0 /\ -__val8^post3+__val8^0 == 0 /\ __len9^0-__len9^post3 == 0), cost: 1
   4: l3 -> l2 : __len9^0'=__len9^post4, tmp___1^0'=tmp___1^post4, tmp10^0'=tmp10^post4, tmp___0^0'=tmp___0^post4, __val8^0'=__val8^post4, tmp^0'=tmp^post4, (__len9^0-__len9^post4 == 0 /\ tmp___1^0-tmp___1^post4 == 0 /\ tmp10^0-tmp10^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -tmp^post4+tmp^0 == 0 /\ 2+tmp___1^0 <= 0 /\ -__val8^post4+__val8^0 == 0), cost: 1
   5: l4 -> l3 : __len9^0'=__len9^post5, tmp___1^0'=tmp___1^post5, tmp10^0'=tmp10^post5, tmp___0^0'=tmp___0^post5, __val8^0'=__val8^post5, tmp^0'=tmp^post5, (0 == 0 /\ __len9^0-__len9^post5 == 0 /\ -__val8^post5+__val8^0 == 0 /\ tmp___0^0-tmp___0^post5 == 0 /\ tmp10^0-tmp10^post5 == 0), cost: 1
   6: l5 -> l4 : __len9^0'=__len9^post6, tmp___1^0'=tmp___1^post6, tmp10^0'=tmp10^post6, tmp___0^0'=tmp___0^post6, __val8^0'=__val8^post6, tmp^0'=tmp^post6, (tmp___1^0-tmp___1^post6 == 0 /\ __len9^0-__len9^post6 == 0 /\ __val8^0-__val8^post6 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ -tmp10^post6+tmp10^0 == 0 /\ -tmp^post6+tmp^0 == 0), cost: 1


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0