WORST_CASE(Omega(0),?)

Initial ITS
Start location: l4
   0: l0 -> l1 : ___patmp1^0'=___patmp1^post0, k_208^0'=k_208^post0, len_263^0'=len_263^post0, ___patmp2^0'=___patmp2^post0, k_243^0'=k_243^post0, (-___patmp2^post0+k_243^post0 == 0 /\ -1+___patmp1^post0 == 0 /\ -k_208^0 <= 0 /\ -___patmp1^post0+len_263^post0 == 0 /\ 1-k_243^post0 <= 0 /\ k_208^0-k_208^post0 == 0 /\ ___patmp2^post0-k_208^0 == 0), cost: 1
   1: l2 -> l3 : ___patmp1^0'=___patmp1^post1, k_208^0'=k_208^post1, len_263^0'=len_263^post1, ___patmp2^0'=___patmp2^post1, k_243^0'=k_243^post1, (-len_263^post1+len_263^0 == 0 /\ ___patmp1^0-___patmp1^post1 == 0 /\ ___patmp2^0-___patmp2^post1 == 0 /\ -k_243^post1+k_243^0 == 0 /\ -k_208^post1+k_208^0 == 0), cost: 1
   2: l4 -> l0 : ___patmp1^0'=___patmp1^post2, k_208^0'=k_208^post2, len_263^0'=len_263^post2, ___patmp2^0'=___patmp2^post2, k_243^0'=k_243^post2, (___patmp1^0-___patmp1^post2 == 0 /\ -___patmp2^post2+___patmp2^0 == 0 /\ -len_263^post2+len_263^0 == 0 /\ k_208^0-k_208^post2 == 0 /\ -k_243^post2+k_243^0 == 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