NO

Initial ITS
Start location: l6
   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
   4: l1 -> l3 : 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, (-selected_11^post4+selected_11^0 == 0 /\ x_5^0-x_5^post4 == 0 /\ -1+retryCount_10^post4-retryCount_10^0 == 0 /\ -__cil_tmp6_12^post4+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post4 == 0 /\ maxRetries_9^0-maxRetries_9^post4 == 0 /\ -Result_4^post4+Result_4^0 == 0), cost: 1
   1: l2 -> l1 : 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 /\ -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 /\ retryCount_10^0-retryCount_10^post1 == 0 /\ -__cil_tmp2_6^post1+Result_4^11 == 0), cost: 1
   2: l3 -> l4 : 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, (__cil_tmp6_12^post2-selected_11^0 == 0 /\ -x_5^post2+x_5^0 == 0 /\ -__cil_tmp6_12^post2+Result_4^post2 == 0 /\ retryCount_10^0-retryCount_10^post2 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post2 == 0 /\ selected_11^0-selected_11^post2 == 0 /\ maxRetries_9^0-maxRetries_9^post2 == 0), cost: 1
   3: l3 -> l1 : 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, (0 == 0 /\ selected_11^post3-Result_4^12 == 0 /\ x_5^0-x_5^post3 == 0 /\ -__cil_tmp2_6^post3+Result_4^12 == 0 /\ retryCount_10^0-retryCount_10^post3 == 0 /\ __cil_tmp2_6^post3-x_5^0 == 0 /\ maxRetries_9^0-maxRetries_9^post3 == 0 /\ -__cil_tmp6_12^post3+__cil_tmp6_12^0 == 0), cost: 1
   5: l5 -> l3 : 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^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -Result_4^post5+Result_4^0 == 0 /\ selected_11^post5 == 0 /\ x_5^0-x_5^post5 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post5 == 0), cost: 1
   6: l6 -> l5 : 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, (retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post6 == 0 /\ -__cil_tmp6_12^post6+__cil_tmp6_12^0 == 0 /\ Result_4^0-Result_4^post6 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l6
   4: l1 -> l3 : 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, (-selected_11^post4+selected_11^0 == 0 /\ x_5^0-x_5^post4 == 0 /\ -1+retryCount_10^post4-retryCount_10^0 == 0 /\ -__cil_tmp6_12^post4+__cil_tmp6_12^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post4 == 0 /\ maxRetries_9^0-maxRetries_9^post4 == 0 /\ -Result_4^post4+Result_4^0 == 0), cost: 1
   3: l3 -> l1 : 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, (0 == 0 /\ selected_11^post3-Result_4^12 == 0 /\ x_5^0-x_5^post3 == 0 /\ -__cil_tmp2_6^post3+Result_4^12 == 0 /\ retryCount_10^0-retryCount_10^post3 == 0 /\ __cil_tmp2_6^post3-x_5^0 == 0 /\ maxRetries_9^0-maxRetries_9^post3 == 0 /\ -__cil_tmp6_12^post3+__cil_tmp6_12^0 == 0), cost: 1
   5: l5 -> l3 : 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^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -Result_4^post5+Result_4^0 == 0 /\ selected_11^post5 == 0 /\ x_5^0-x_5^post5 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post5 == 0), cost: 1
   6: l6 -> l5 : 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, (retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post6 == 0 /\ -__cil_tmp6_12^post6+__cil_tmp6_12^0 == 0 /\ Result_4^0-Result_4^post6 == 0), cost: 1


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

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

Applied preprocessing
Original rule:
l5 -> l3 : 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^post5 == 0 /\ -4+maxRetries_9^post5 == 0 /\ __cil_tmp6_12^0-__cil_tmp6_12^post5 == 0 /\ -Result_4^post5+Result_4^0 == 0 /\ selected_11^post5 == 0 /\ x_5^0-x_5^post5 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post5 == 0), cost: 1
New rule:
l5 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : 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, (retryCount_10^0-retryCount_10^post6 == 0 /\ -x_5^post6+x_5^0 == 0 /\ selected_11^0-selected_11^post6 == 0 /\ -maxRetries_9^post6+maxRetries_9^0 == 0 /\ __cil_tmp2_6^0-__cil_tmp2_6^post6 == 0 /\ -__cil_tmp6_12^post6+__cil_tmp6_12^0 == 0 /\ Result_4^0-Result_4^post6 == 0), cost: 1
New rule:
l6 -> l5 : TRUE, cost: 1

Simplified rules
Start location: l6
   8: l1 -> l3 : retryCount_10^0'=1+retryCount_10^0, TRUE, cost: 1
   7: l3 -> l1 : __cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, 0 == 0, cost: 1
   9: l5 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 1
  10: l6 -> l5 : TRUE, cost: 1


Eliminating location l5 by chaining:

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

Applied deletion
Removed the following rules: 9 10

Eliminating location l1 by chaining:

Applied chaining
First rule:
l3 -> l1 : __cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, 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^post3, selected_11^0'=x_5^0, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 7 8

Eliminated locations on linear paths
Start location: l6
  12: l3 -> l3 : retryCount_10^0'=1+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, 0 == 0, cost: 2
  11: l6 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2


Applied nonterm
Original rule:
l3 -> l3 : retryCount_10^0'=1+retryCount_10^0, __cil_tmp2_6^0'=x_5^0, Result_4^0'=Result_4^post3, selected_11^0'=x_5^0, 0 == 0, cost: 2
New rule:
l3 -> [7] : (0 >= 0 /\ -1+n >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_KpeFMk.txt

Applied simplification
Original rule:
l3 -> [7] : (0 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
l3 -> [7] : -1+n >= 0, cost: NONTERM

Applied deletion
Removed the following rules: 12

Accelerated simple loops
Start location: l6
  14: l3 -> [7] : -1+n >= 0, cost: NONTERM
  11: l6 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2


Applied chaining
First rule:
l6 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2
Second rule:
l3 -> [7] : -1+n >= 0, cost: NONTERM
New rule:
l6 -> [7] : TRUE, cost: NONTERM

Applied deletion
Removed the following rules: 14

Chained accelerated rules with incoming rules
Start location: l6
  11: l6 -> l3 : retryCount_10^0'=0, maxRetries_9^0'=4, selected_11^0'=0, TRUE, cost: 2
  15: l6 -> [7] : TRUE, cost: NONTERM


Removed unreachable locations and irrelevant leafs
Start location: l6
  15: l6 -> [7] : TRUE, cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 15 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  TRUE