WORST_CASE(Omega(0),?)

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


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


Applied preprocessing
Original rule:
l3 -> l1 : retryCount_10^0'=retryCount_10^post6, ___cil_tmp2_6^0'=___cil_tmp2_6^post6, x_5^0'=x_5^post6, maxRetries_9^0'=maxRetries_9^post6, Result_4^0'=Result_4^post6, selected_11^0'=selected_11^post6, ___cil_tmp6_12^0'=___cil_tmp6_12^post6, (0 == 0 /\ selected_11^post6-Result_4^12 == 0 /\ retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ 1+retryCount_10^0-maxRetries_9^0 <= 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0 /\ -selected_11^0 <= 0 /\ selected_11^0 <= 0 /\ -x_5^0+___cil_tmp2_6^post6 == 0 /\ -___cil_tmp6_12^post6+___cil_tmp6_12^0 == 0 /\ Result_4^12-___cil_tmp2_6^post6 == 0), cost: 1
New rule:
l3 -> l1 : ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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 : retryCount_10^0'=retryCount_10^post7, ___cil_tmp2_6^0'=___cil_tmp2_6^post7, x_5^0'=x_5^post7, maxRetries_9^0'=maxRetries_9^post7, Result_4^0'=Result_4^post7, selected_11^0'=selected_11^post7, ___cil_tmp6_12^0'=___cil_tmp6_12^post7, (Result_4^0-Result_4^post7 == 0 /\ -___cil_tmp6_12^post7+___cil_tmp6_12^0 == 0 /\ maxRetries_9^0-maxRetries_9^post7 == 0 /\ -1-retryCount_10^0+retryCount_10^post7 == 0 /\ -selected_11^post7+selected_11^0 == 0 /\ ___cil_tmp2_6^0-___cil_tmp2_6^post7 == 0 /\ -x_5^post7+x_5^0 == 0), cost: 1
New rule:
l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l3 : retryCount_10^0'=retryCount_10^post8, ___cil_tmp2_6^0'=___cil_tmp2_6^post8, x_5^0'=x_5^post8, maxRetries_9^0'=maxRetries_9^post8, Result_4^0'=Result_4^post8, selected_11^0'=selected_11^post8, ___cil_tmp6_12^0'=___cil_tmp6_12^post8, (selected_11^post8 == 0 /\ -x_5^post8+x_5^0 == 0 /\ -4+maxRetries_9^post8 == 0 /\ Result_4^0-Result_4^post8 == 0 /\ -___cil_tmp6_12^post8+___cil_tmp6_12^0 == 0 /\ retryCount_10^post8 == 0 /\ ___cil_tmp2_6^0-___cil_tmp2_6^post8 == 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 : retryCount_10^0'=retryCount_10^post9, ___cil_tmp2_6^0'=___cil_tmp2_6^post9, x_5^0'=x_5^post9, maxRetries_9^0'=maxRetries_9^post9, Result_4^0'=Result_4^post9, selected_11^0'=selected_11^post9, ___cil_tmp6_12^0'=___cil_tmp6_12^post9, (-___cil_tmp2_6^post9+___cil_tmp2_6^0 == 0 /\ retryCount_10^0-retryCount_10^post9 == 0 /\ -selected_11^post9+selected_11^0 == 0 /\ -___cil_tmp6_12^post9+___cil_tmp6_12^0 == 0 /\ -Result_4^post9+Result_4^0 == 0 /\ maxRetries_9^0-maxRetries_9^post9 == 0 /\ x_5^0-x_5^post9 == 0), cost: 1
New rule:
l8 -> l7 : TRUE, cost: 1

Simplified rules
Start location: l8
  11: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1
  10: l3 -> l1 : ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 1
  12: l7 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1
  13: 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: 12 13

Eliminating location l1 by chaining:

Applied chaining
First rule:
l3 -> l1 : ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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 : retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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: 10 11

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


Applied acceleration
Original rule:
l3 -> l3 : retryCount_10^0'=1+retryCount_10^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (1+retryCount_10^0-maxRetries_9^0 <= 0 /\ selected_11^0 == 0), cost: 2
New rule:
l3 -> l3 : retryCount_10^0'=retryCount_10^0+n, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (-retryCount_10^0-n+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0 /\ -1+n >= 0 /\ x_5^0 >= 0 /\ -selected_11^0 >= 0 /\ selected_11^0 >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EPHoBI.txt

Applied instantiation
Original rule:
l3 -> l3 : retryCount_10^0'=retryCount_10^0+n, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (-retryCount_10^0-n+maxRetries_9^0 >= 0 /\ -x_5^0 >= 0 /\ -1+n >= 0 /\ x_5^0 >= 0 /\ -selected_11^0 >= 0 /\ selected_11^0 >= 0), cost: 2*n
New rule:
l3 -> l3 : retryCount_10^0'=maxRetries_9^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (0 >= 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 simplification
Original rule:
l3 -> l3 : retryCount_10^0'=maxRetries_9^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, (0 >= 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:
l3 -> l3 : retryCount_10^0'=maxRetries_9^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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: 15

Accelerated simple loops
Start location: l8
  17: l3 -> l3 : retryCount_10^0'=maxRetries_9^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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
  14: 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 : retryCount_10^0'=maxRetries_9^0, ___cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post6, 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 : retryCount_10^0'=4, ___cil_tmp2_6^0'=x_5^0, maxRetries_9^0'=4, Result_4^0'=Result_4^post6, selected_11^0'=x_5^0, x_5^0 == 0, cost: 10

Applied deletion
Removed the following rules: 17

Chained accelerated rules with incoming rules
Start location: l8
  14: l8 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2
  18: l8 -> l3 : retryCount_10^0'=4, ___cil_tmp2_6^0'=x_5^0, maxRetries_9^0'=4, Result_4^0'=Result_4^post6, 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