WORST_CASE(Omega(0),?)

Initial ITS
Start location: l2
   0: l0 -> l1 : Result_4^0'=Result_4^post0, loop_count_14^0'=loop_count_14^post0, request_8^0'=request_8^post0, devExt_7^0'=devExt_7^post0, lt_47^0'=lt_47^post0, irp_11^0'=irp_11^post0, nPackets_10^0'=nPackets_10^post0, cnt_59^0'=cnt_59^post0, loop_max_13^0'=loop_max_13^post0, i_12^0'=i_12^post0, nPacketsOld_9^0'=nPacketsOld_9^post0, (0 == 0 /\ -cnt_59^0+lt_47^post0 == 0 /\ -cnt_59^post0+cnt_59^0 == 0), cost: 1
   1: l2 -> l0 : Result_4^0'=Result_4^post1, loop_count_14^0'=loop_count_14^post1, request_8^0'=request_8^post1, devExt_7^0'=devExt_7^post1, lt_47^0'=lt_47^post1, irp_11^0'=irp_11^post1, nPackets_10^0'=nPackets_10^post1, cnt_59^0'=cnt_59^post1, loop_max_13^0'=loop_max_13^post1, i_12^0'=i_12^post1, nPacketsOld_9^0'=nPacketsOld_9^post1, (-nPacketsOld_9^post1+nPacketsOld_9^0 == 0 /\ nPackets_10^0-nPackets_10^post1 == 0 /\ -loop_max_13^post1+loop_max_13^0 == 0 /\ -devExt_7^post1+devExt_7^0 == 0 /\ -cnt_59^post1+cnt_59^0 == 0 /\ Result_4^0-Result_4^post1 == 0 /\ irp_11^0-irp_11^post1 == 0 /\ -lt_47^post1+lt_47^0 == 0 /\ loop_count_14^0-loop_count_14^post1 == 0 /\ -i_12^post1+i_12^0 == 0 /\ request_8^0-request_8^post1 == 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