WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : rt_11^0'=rt_11^post0, x_13^0'=x_13^post0, st_14^0'=st_14^post0, (1-x_13^0+x_13^post0 == 0 /\ -x_13^0 <= 0 /\ rt_11^post0-st_14^0 == 0 /\ -st_14^post0+st_14^0 == 0), cost: 1
   1: l0 -> l1 : rt_11^0'=rt_11^post1, x_13^0'=x_13^post1, st_14^0'=st_14^post1, (x_13^0-x_13^post1 == 0 /\ st_14^0-st_14^post1 == 0 /\ rt_11^post1-st_14^0 == 0 /\ 1+x_13^0 <= 0), cost: 1
   2: l2 -> l0 : rt_11^0'=rt_11^post2, x_13^0'=x_13^post2, st_14^0'=st_14^post2, (x_13^0-x_13^post2 == 0 /\ st_14^0-st_14^post2 == 0 /\ rt_11^0-rt_11^post2 == 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