WORST_CASE(Omega(0),?)

Initial ITS
Start location: l8
   0: l0 -> l1 : Result_4^0'=Result_4^post0, retryCount_10^0'=retryCount_10^post0, __cil_tmp6_12^0'=__cil_tmp6_12^post0, x_5^0'=x_5^post0, maxRetries_9^0'=maxRetries_9^post0, __cil_tmp2_6^0'=__cil_tmp2_6^post0, selected_11^0'=selected_11^post0, __disjvr_0^0'=__disjvr_0^post0, (0 == 0 /\ __disjvr_0^0-__disjvr_0^post0 == 0 /\ Result_4^10-__cil_tmp2_6^post0 == 0 /\ x_5^0-x_5^post0 == 0 /\ maxRetries_9^0-maxRetries_9^post0 == 0 /\ __cil_tmp2_6^post0-x_5^0 == 0 /\ -Result_4^10+selected_11^post0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post0 == 0 /\ retryCount_10^0-retryCount_10^post0 == 0), cost: 1
   6: l1 -> l3 : Result_4^0'=Result_4^post6, retryCount_10^0'=retryCount_10^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, __cil_tmp2_6^0'=__cil_tmp2_6^post6, selected_11^0'=selected_11^post6, __disjvr_0^0'=__disjvr_0^post6, (__cil_tmp6_12^0-__cil_tmp6_12^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ -__disjvr_0^post6+__disjvr_0^0 == 0 /\ -1-retryCount_10^0+retryCount_10^post6 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^0 == 0 /\ maxRetries_9^0-maxRetries_9^post6 == 0), cost: 1
   1: l2 -> l3 : Result_4^0'=Result_4^post1, retryCount_10^0'=retryCount_10^post1, __cil_tmp6_12^0'=__cil_tmp6_12^post1, x_5^0'=x_5^post1, maxRetries_9^0'=maxRetries_9^post1, __cil_tmp2_6^0'=__cil_tmp2_6^post1, selected_11^0'=selected_11^post1, __disjvr_0^0'=__disjvr_0^post1, (0 == 0 /\ -1-retryCount_10^0+retryCount_10^post1 == 0 /\ selected_11^post1-Result_4^11 == 0 /\ -__cil_tmp2_6^post1+Result_4^11 == 0 /\ x_5^0-x_5^post1 == 0 /\ -__cil_tmp6_12^post1+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^post1-x_5^0 == 0 /\ -maxRetries_9^post1+maxRetries_9^0 == 0 /\ -__disjvr_0^post1+__disjvr_0^0 == 0), cost: 1
   2: l3 -> l5 : Result_4^0'=Result_4^post2, retryCount_10^0'=retryCount_10^post2, __cil_tmp6_12^0'=__cil_tmp6_12^post2, x_5^0'=x_5^post2, maxRetries_9^0'=maxRetries_9^post2, __cil_tmp2_6^0'=__cil_tmp2_6^post2, selected_11^0'=selected_11^post2, __disjvr_0^0'=__disjvr_0^post2, (Result_4^0-Result_4^post2 == 0 /\ retryCount_10^0-retryCount_10^post2 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post2 == 0 /\ -__disjvr_0^post2+__disjvr_0^0 == 0 /\ selected_11^0-selected_11^post2 == 0 /\ -__cil_tmp2_6^post2+__cil_tmp2_6^0 == 0 /\ __disjvr_0^post2-__disjvr_0^0 == 0 /\ maxRetries_9^0-maxRetries_9^post2 == 0 /\ -x_5^post2+x_5^0 == 0), cost: 1
   4: l3 -> l6 : Result_4^0'=Result_4^post4, retryCount_10^0'=retryCount_10^post4, __cil_tmp6_12^0'=__cil_tmp6_12^post4, x_5^0'=x_5^post4, maxRetries_9^0'=maxRetries_9^post4, __cil_tmp2_6^0'=__cil_tmp2_6^post4, selected_11^0'=selected_11^post4, __disjvr_0^0'=__disjvr_0^post4, (-selected_11^0 <= 0 /\ -retryCount_10^0+maxRetries_9^0 <= 0 /\ __disjvr_0^0-__disjvr_0^post4 == 0 /\ maxRetries_9^0-maxRetries_9^post4 == 0 /\ x_5^0-x_5^post4 == 0 /\ -retryCount_10^post4+retryCount_10^0 == 0 /\ -__cil_tmp2_6^post4+__cil_tmp2_6^0 == 0 /\ selected_11^0 <= 0 /\ __cil_tmp6_12^post4-selected_11^0 == 0 /\ Result_4^post4-__cil_tmp6_12^post4 == 0 /\ -selected_11^post4+selected_11^0 == 0), cost: 1
   5: l3 -> l1 : Result_4^0'=Result_4^post5, retryCount_10^0'=retryCount_10^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, __cil_tmp2_6^0'=__cil_tmp2_6^post5, selected_11^0'=selected_11^post5, __disjvr_0^0'=__disjvr_0^post5, (0 == 0 /\ -__cil_tmp2_6^post5+Result_4^12 == 0 /\ selected_11^post5-Result_4^12 == 0 /\ -selected_11^0 <= 0 /\ __cil_tmp2_6^post5-x_5^0 == 0 /\ 1+retryCount_10^0-maxRetries_9^0 <= 0 /\ retryCount_10^0-retryCount_10^post5 == 0 /\ -__disjvr_0^post5+__disjvr_0^0 == 0 /\ selected_11^0 <= 0 /\ -__cil_tmp6_12^post5+__cil_tmp6_12^0 == 0 /\ x_5^0-x_5^post5 == 0 /\ -maxRetries_9^post5+maxRetries_9^0 == 0), cost: 1
   3: l5 -> l4 : Result_4^0'=Result_4^post3, retryCount_10^0'=retryCount_10^post3, __cil_tmp6_12^0'=__cil_tmp6_12^post3, x_5^0'=x_5^post3, maxRetries_9^0'=maxRetries_9^post3, __cil_tmp2_6^0'=__cil_tmp2_6^post3, selected_11^0'=selected_11^post3, __disjvr_0^0'=__disjvr_0^post3, (retryCount_10^0-retryCount_10^post3 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post3 == 0 /\ x_5^0-x_5^post3 == 0 /\ -__disjvr_0^post3+__disjvr_0^0 == 0 /\ Result_4^post3-__cil_tmp6_12^post3 == 0 /\ -selected_11^post3+selected_11^0 == 0 /\ -selected_11^0+__cil_tmp6_12^post3 == 0 /\ -maxRetries_9^post3+maxRetries_9^0 == 0), cost: 1
   7: l7 -> l3 : Result_4^0'=Result_4^post7, retryCount_10^0'=retryCount_10^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, x_5^0'=x_5^post7, maxRetries_9^0'=maxRetries_9^post7, __cil_tmp2_6^0'=__cil_tmp2_6^post7, selected_11^0'=selected_11^post7, __disjvr_0^0'=__disjvr_0^post7, (-__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -__disjvr_0^post7+__disjvr_0^0 == 0 /\ x_5^0-x_5^post7 == 0 /\ selected_11^post7 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post7 == 0 /\ Result_4^0-Result_4^post7 == 0 /\ -4+maxRetries_9^post7 == 0 /\ retryCount_10^post7 == 0), cost: 1
   8: l8 -> l7 : Result_4^0'=Result_4^post8, retryCount_10^0'=retryCount_10^post8, __cil_tmp6_12^0'=__cil_tmp6_12^post8, x_5^0'=x_5^post8, maxRetries_9^0'=maxRetries_9^post8, __cil_tmp2_6^0'=__cil_tmp2_6^post8, selected_11^0'=selected_11^post8, __disjvr_0^0'=__disjvr_0^post8, (x_5^0-x_5^post8 == 0 /\ -__disjvr_0^post8+__disjvr_0^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post8 == 0 /\ -maxRetries_9^post8+maxRetries_9^0 == 0 /\ retryCount_10^0-retryCount_10^post8 == 0 /\ selected_11^0-selected_11^post8 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post8 == 0 /\ Result_4^0-Result_4^post8 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l8
   6: l1 -> l3 : Result_4^0'=Result_4^post6, retryCount_10^0'=retryCount_10^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, __cil_tmp2_6^0'=__cil_tmp2_6^post6, selected_11^0'=selected_11^post6, __disjvr_0^0'=__disjvr_0^post6, (__cil_tmp6_12^0-__cil_tmp6_12^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ -__disjvr_0^post6+__disjvr_0^0 == 0 /\ -1-retryCount_10^0+retryCount_10^post6 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^0 == 0 /\ maxRetries_9^0-maxRetries_9^post6 == 0), cost: 1
   5: l3 -> l1 : Result_4^0'=Result_4^post5, retryCount_10^0'=retryCount_10^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, __cil_tmp2_6^0'=__cil_tmp2_6^post5, selected_11^0'=selected_11^post5, __disjvr_0^0'=__disjvr_0^post5, (0 == 0 /\ -__cil_tmp2_6^post5+Result_4^12 == 0 /\ selected_11^post5-Result_4^12 == 0 /\ -selected_11^0 <= 0 /\ __cil_tmp2_6^post5-x_5^0 == 0 /\ 1+retryCount_10^0-maxRetries_9^0 <= 0 /\ retryCount_10^0-retryCount_10^post5 == 0 /\ -__disjvr_0^post5+__disjvr_0^0 == 0 /\ selected_11^0 <= 0 /\ -__cil_tmp6_12^post5+__cil_tmp6_12^0 == 0 /\ x_5^0-x_5^post5 == 0 /\ -maxRetries_9^post5+maxRetries_9^0 == 0), cost: 1
   7: l7 -> l3 : Result_4^0'=Result_4^post7, retryCount_10^0'=retryCount_10^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, x_5^0'=x_5^post7, maxRetries_9^0'=maxRetries_9^post7, __cil_tmp2_6^0'=__cil_tmp2_6^post7, selected_11^0'=selected_11^post7, __disjvr_0^0'=__disjvr_0^post7, (-__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -__disjvr_0^post7+__disjvr_0^0 == 0 /\ x_5^0-x_5^post7 == 0 /\ selected_11^post7 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post7 == 0 /\ Result_4^0-Result_4^post7 == 0 /\ -4+maxRetries_9^post7 == 0 /\ retryCount_10^post7 == 0), cost: 1
   8: l8 -> l7 : Result_4^0'=Result_4^post8, retryCount_10^0'=retryCount_10^post8, __cil_tmp6_12^0'=__cil_tmp6_12^post8, x_5^0'=x_5^post8, maxRetries_9^0'=maxRetries_9^post8, __cil_tmp2_6^0'=__cil_tmp2_6^post8, selected_11^0'=selected_11^post8, __disjvr_0^0'=__disjvr_0^post8, (x_5^0-x_5^post8 == 0 /\ -__disjvr_0^post8+__disjvr_0^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post8 == 0 /\ -maxRetries_9^post8+maxRetries_9^0 == 0 /\ retryCount_10^0-retryCount_10^post8 == 0 /\ selected_11^0-selected_11^post8 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post8 == 0 /\ Result_4^0-Result_4^post8 == 0), cost: 1


Applied preprocessing
Original rule:
l3 -> l1 : Result_4^0'=Result_4^post5, retryCount_10^0'=retryCount_10^post5, __cil_tmp6_12^0'=__cil_tmp6_12^post5, x_5^0'=x_5^post5, maxRetries_9^0'=maxRetries_9^post5, __cil_tmp2_6^0'=__cil_tmp2_6^post5, selected_11^0'=selected_11^post5, __disjvr_0^0'=__disjvr_0^post5, (0 == 0 /\ -__cil_tmp2_6^post5+Result_4^12 == 0 /\ selected_11^post5-Result_4^12 == 0 /\ -selected_11^0 <= 0 /\ __cil_tmp2_6^post5-x_5^0 == 0 /\ 1+retryCount_10^0-maxRetries_9^0 <= 0 /\ retryCount_10^0-retryCount_10^post5 == 0 /\ -__disjvr_0^post5+__disjvr_0^0 == 0 /\ selected_11^0 <= 0 /\ -__cil_tmp6_12^post5+__cil_tmp6_12^0 == 0 /\ x_5^0-x_5^post5 == 0 /\ -maxRetries_9^post5+maxRetries_9^0 == 0), cost: 1
New rule:
l3 -> l1 : Result_4^0'=Result_4^post5, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 1

Applied preprocessing
Original rule:
l1 -> l3 : Result_4^0'=Result_4^post6, retryCount_10^0'=retryCount_10^post6, __cil_tmp6_12^0'=__cil_tmp6_12^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, __cil_tmp2_6^0'=__cil_tmp2_6^post6, selected_11^0'=selected_11^post6, __disjvr_0^0'=__disjvr_0^post6, (__cil_tmp6_12^0-__cil_tmp6_12^post6 == 0 /\ Result_4^0-Result_4^post6 == 0 /\ -__disjvr_0^post6+__disjvr_0^0 == 0 /\ -1-retryCount_10^0+retryCount_10^post6 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -__cil_tmp2_6^post6+__cil_tmp2_6^0 == 0 /\ -x_5^post6+x_5^0 == 0 /\ maxRetries_9^0-maxRetries_9^post6 == 0), cost: 1
New rule:
l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l3 : Result_4^0'=Result_4^post7, retryCount_10^0'=retryCount_10^post7, __cil_tmp6_12^0'=__cil_tmp6_12^post7, x_5^0'=x_5^post7, maxRetries_9^0'=maxRetries_9^post7, __cil_tmp2_6^0'=__cil_tmp2_6^post7, selected_11^0'=selected_11^post7, __disjvr_0^0'=__disjvr_0^post7, (-__cil_tmp2_6^post7+__cil_tmp2_6^0 == 0 /\ -__disjvr_0^post7+__disjvr_0^0 == 0 /\ x_5^0-x_5^post7 == 0 /\ selected_11^post7 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post7 == 0 /\ Result_4^0-Result_4^post7 == 0 /\ -4+maxRetries_9^post7 == 0 /\ retryCount_10^post7 == 0), cost: 1
New rule:
l7 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l7 : Result_4^0'=Result_4^post8, retryCount_10^0'=retryCount_10^post8, __cil_tmp6_12^0'=__cil_tmp6_12^post8, x_5^0'=x_5^post8, maxRetries_9^0'=maxRetries_9^post8, __cil_tmp2_6^0'=__cil_tmp2_6^post8, selected_11^0'=selected_11^post8, __disjvr_0^0'=__disjvr_0^post8, (x_5^0-x_5^post8 == 0 /\ -__disjvr_0^post8+__disjvr_0^0 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post8 == 0 /\ -maxRetries_9^post8+maxRetries_9^0 == 0 /\ retryCount_10^0-retryCount_10^post8 == 0 /\ selected_11^0-selected_11^post8 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post8 == 0 /\ Result_4^0-Result_4^post8 == 0), cost: 1
New rule:
l8 -> l7 : TRUE, cost: 1

Simplified rules
Start location: l8
  10: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1
   9: l3 -> l1 : Result_4^0'=Result_4^post5, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 1
  11: l7 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1
  12: l8 -> l7 : TRUE, cost: 1


Eliminating location l7 by chaining:

Applied chaining
First rule:
l8 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1
New rule:
l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2

Applied deletion
Removed the following rules: 11 12

Eliminating location l1 by chaining:

Applied chaining
First rule:
l3 -> l1 : Result_4^0'=Result_4^post5, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 1
Second rule:
l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1
New rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=1+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 2

Applied deletion
Removed the following rules: 9 10

Eliminated locations on linear paths
Start location: l8
  14: l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=1+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 2
  13: l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2


Applied acceleration
Original rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=1+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 2
New rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=n0+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (-selected_11^0 >= 0 /\ x_5^0 >= 0 /\ -1+n0 >= 0 /\ selected_11^0 >= 0 /\ -n0-retryCount_10^0+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=n0+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (-selected_11^0 >= 0 /\ x_5^0 >= 0 /\ -1+n0 >= 0 /\ selected_11^0 >= 0 /\ -n0-retryCount_10^0+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0), cost: 2*n0
New rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=maxRetries_9^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (0 >= 0 /\ -selected_11^0 >= 0 /\ x_5^0 >= 0 /\ selected_11^0 >= 0 /\ -1-retryCount_10^0+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0), cost: -2*retryCount_10^0+2*maxRetries_9^0

Applied simplification
Original rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=maxRetries_9^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (0 >= 0 /\ -selected_11^0 >= 0 /\ x_5^0 >= 0 /\ selected_11^0 >= 0 /\ -1-retryCount_10^0+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0), cost: -2*retryCount_10^0+2*maxRetries_9^0
New rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=maxRetries_9^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (x_5^0 <= 0 /\ x_5^0 >= 0 /\ selected_11^0 <= 0 /\ selected_11^0 >= 0 /\ -1-retryCount_10^0+maxRetries_9^0 >= 0), cost: -2*retryCount_10^0+2*maxRetries_9^0

Applied deletion
Removed the following rules: 14

Accelerated simple loops
Start location: l8
  16: l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=maxRetries_9^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (x_5^0 <= 0 /\ x_5^0 >= 0 /\ selected_11^0 <= 0 /\ selected_11^0 >= 0 /\ -1-retryCount_10^0+maxRetries_9^0 >= 0), cost: -2*retryCount_10^0+2*maxRetries_9^0
  13: l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2


Applied chaining
First rule:
l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2
Second rule:
l3 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=maxRetries_9^0, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, (x_5^0 <= 0 /\ x_5^0 >= 0 /\ selected_11^0 <= 0 /\ selected_11^0 >= 0 /\ -1-retryCount_10^0+maxRetries_9^0 >= 0), cost: -2*retryCount_10^0+2*maxRetries_9^0
New rule:
l8 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=4, maxRetries_9^0'=4, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, x_5^0 == 0, cost: 10

Applied deletion
Removed the following rules: 16

Chained accelerated rules with incoming rules
Start location: l8
  13: l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2
  17: l8 -> l3 : Result_4^0'=Result_4^post5, retryCount_10^0'=4, maxRetries_9^0'=4, __cil_tmp2_6^0'=x_5^0, selected_11^0'=x_5^0, x_5^0 == 0, cost: 10


Removed unreachable locations and irrelevant leafs
Start location: l8
  <empty>


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0