WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : x_5^0'=x_5^post0, Result_4^0'=Result_4^post0, (-1+x_5^post0-x_5^0 == 0 /\ -x_5^0 <= 0 /\ -Result_4^post0+Result_4^0 == 0), cost: 1
   1: l0 -> l1 : x_5^0'=x_5^post1, Result_4^0'=Result_4^post1, (Result_4^0-Result_4^post1 == 0 /\ 1+x_5^0 <= 0 /\ x_5^0-x_5^post1 == 0), cost: 1
   3: l1 -> l3 : x_5^0'=x_5^post3, Result_4^0'=Result_4^post3, (0 == 0 /\ x_5^0-x_5^post3 == 0), cost: 1
   2: l2 -> l0 : x_5^0'=x_5^post2, Result_4^0'=Result_4^post2, (Result_4^0-Result_4^post2 == 0 /\ x_5^0-x_5^post2 == 0), cost: 1
   4: l4 -> l2 : x_5^0'=x_5^post4, Result_4^0'=Result_4^post4, (x_5^0-x_5^post4 == 0 /\ Result_4^0-Result_4^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