NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l29, true>
<l1, l2, ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)), par{l^0 -> (1 + l^0)}>
<l1, l3, ((1 + l^0) <= (0 + m^0))>
<l1, l3, ((1 + m^0) <= (0 + l^0))>
<l4, l1, true>
<l5, l2, ((1 + n^0) <= (0 + i^0))>
<l5, l6, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l7, l4, ((1 + i^0) <= (0 + l^0))>
<l7, l1, ((0 + l^0) <= (0 + i^0))>
<l8, l9, true>
<l9, l4, (1 <= (0 + r^0))>
<l9, l4, ((1 + r^0) <= 0)>
<l9, l7, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0))>
<l2, l10, true>
<l11, l12, ((1 + n^0) <= (0 + k^0)), par{i^0 -> (~(1) + i^0)}>
<l11, l13, ((0 + k^0) <= (0 + n^0)) /\ (undef298 = undef298), par{f^0 -> undef298, k^0 -> (1 + k^0)}>
<l14, l13, (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{c^0 -> undef317, g^0 -> undef320, p^0 -> undef327, r^0 -> undef328, s^0 -> undef329}>
<l3, l15, true>
<l16, l14, (1 <= (0 + r^0))>
<l16, l14, ((1 + r^0) <= 0)>
<l16, l8, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0))>
<l17, l8, ((1 + i^0) <= (0 + l^0))>
<l17, l16, ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455), par{b^0 -> undef443, f^0 -> undef446, r^0 -> undef455}>
<l15, l18, true>
<l19, l12, (undef489 = undef489) /\ (undef486 = 1), par{c^0 -> undef486, g^0 -> undef489, p^0 -> 0, s^0 -> (0 + undef486)}>
<l20, l19, ((1 + g^0) <= 0) /\ (undef525 = undef525), par{tmp___4^0 -> undef525, tmp___5^0 -> (0 + (~(1) * undef525))}>
<l20, l19, (0 <= (0 + g^0)) /\ (undef545 = undef545), par{tmp___3^0 -> undef545, tmp___5^0 -> (0 + undef545)}>
<l21, l20, (undef552 = undef552) /\ (undef560 = undef560), par{g^0 -> undef552, r^0 -> undef560}>
<l12, l17, true>
<l22, l21, (31 <= (0 + tmp___2^0))>
<l22, l21, ((1 + tmp___2^0) <= 30)>
<l22, l21, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0))>
<l23, l22, true, par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}>
<l24, l25, true>
<l25, l1, ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0))>
<l25, l23, ((1 + l^0) <= (0 + m^0))>
<l25, l23, ((1 + m^0) <= (0 + l^0))>
<l26, l15, true, par{m^0 -> (1 + m^0)}>
<l27, l26, ((1 + dd^0) <= ((0 + dd^0) + tmp___1^0))>
<l27, l26, (((1 + dd^0) + tmp___1^0) <= (0 + dd^0))>
<l27, l24, (((0 + dd^0) + tmp___1^0) <= (0 + dd^0)) /\ ((0 + dd^0) <= ((0 + dd^0) + tmp___1^0))>
<l13, l11, true>
<l18, l24, ((0 + n^0) <= (0 + m^0))>
<l18, l27, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900), par{dd^0 -> ((0 + undef898) + undef899), tmp^0 -> undef898, tmp___0^0 -> undef899, tmp___1^0 -> undef900}>
<l10, l28, ((1 + n^0) <= (0 + l^0))>
<l10, l3, ((0 + l^0) <= (0 + n^0)), par{iter^0 -> 0}>
<l6, l5, true>
<l29, l6, true>

Fresh variables:
undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 

Undef variables:
undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l6, true>
<l6, l28, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + l^0))>
<l6, l15, ((1 + n^0) <= (0 + i^0)) /\ ((0 + l^0) <= (0 + n^0)), par{iter^0 -> 0}>
<l6, l6, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}>
<l9, l28, (1 <= (0 + r^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}>
<l9, l15, (1 <= (0 + r^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}>
<l9, l15, (1 <= (0 + r^0)) /\ ((1 + l^0) <= (0 + m^0))>
<l9, l15, (1 <= (0 + r^0)) /\ ((1 + m^0) <= (0 + l^0))>
<l9, l28, ((1 + r^0) <= 0) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}>
<l9, l15, ((1 + r^0) <= 0) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}>
<l9, l15, ((1 + r^0) <= 0) /\ ((1 + l^0) <= (0 + m^0))>
<l9, l15, ((1 + r^0) <= 0) /\ ((1 + m^0) <= (0 + l^0))>
<l9, l28, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((1 + l^0) <= (0 + m^0))>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((1 + i^0) <= (0 + l^0)) /\ ((1 + m^0) <= (0 + l^0))>
<l9, l28, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((1 + l^0) <= (0 + m^0))>
<l9, l15, ((0 + r^0) <= 0) /\ (0 <= (0 + r^0)) /\ ((0 + l^0) <= (0 + i^0)) /\ ((1 + m^0) <= (0 + l^0))>
<l13, l9, ((1 + n^0) <= (0 + k^0)) /\ ((1 + (~(1) + i^0)) <= (0 + l^0)), par{i^0 -> (~(1) + i^0)}>
<l13, l13, ((1 + n^0) <= (0 + k^0)) /\ ((0 + l^0) <= (0 + (~(1) + i^0))) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{i^0 -> (~(1) + i^0), r^0 -> undef328}>
<l13, l13, ((1 + n^0) <= (0 + k^0)) /\ ((0 + l^0) <= (0 + (~(1) + i^0))) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{i^0 -> (~(1) + i^0), r^0 -> undef328}>
<l13, l9, ((1 + n^0) <= (0 + k^0)) /\ ((0 + l^0) <= (0 + (~(1) + i^0))) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{i^0 -> (~(1) + i^0), r^0 -> undef455}>
<l13, l13, ((0 + k^0) <= (0 + n^0)) /\ (undef298 = undef298), par{k^0 -> (1 + k^0)}>
<l15, l28, ((0 + n^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((1 + n^0) <= (0 + (1 + l^0))), par{l^0 -> (1 + l^0)}>
<l15, l22, ((0 + n^0) <= (0 + m^0)) /\ ((1 + l^0) <= (0 + m^0)), par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}>
<l15, l22, ((0 + n^0) <= (0 + m^0)) /\ ((1 + m^0) <= (0 + l^0)), par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}>
<l15, l15, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900) /\ ((1 + ((0 + undef898) + undef899)) <= ((0 + ((0 + undef898) + undef899)) + undef900)), par{m^0 -> (1 + m^0)}>
<l15, l15, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900) /\ (((1 + ((0 + undef898) + undef899)) + undef900) <= (0 + ((0 + undef898) + undef899))), par{m^0 -> (1 + m^0)}>
<l15, l15, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900) /\ (((0 + ((0 + undef898) + undef899)) + undef900) <= (0 + ((0 + undef898) + undef899))) /\ ((0 + ((0 + undef898) + undef899)) <= ((0 + ((0 + undef898) + undef899)) + undef900)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + l^0)) /\ ((0 + l^0) <= (0 + m^0)) /\ ((0 + (1 + l^0)) <= (0 + n^0)), par{iter^0 -> 0, l^0 -> (1 + l^0)}>
<l15, l22, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900) /\ (((0 + ((0 + undef898) + undef899)) + undef900) <= (0 + ((0 + undef898) + undef899))) /\ ((0 + ((0 + undef898) + undef899)) <= ((0 + ((0 + undef898) + undef899)) + undef900)) /\ ((1 + l^0) <= (0 + m^0)), par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}>
<l15, l22, ((0 + m^0) <= (~(1) + n^0)) /\ (undef898 = undef898) /\ (undef899 = undef899) /\ (undef900 = undef900) /\ (((0 + ((0 + undef898) + undef899)) + undef900) <= (0 + ((0 + undef898) + undef899))) /\ ((0 + ((0 + undef898) + undef899)) <= ((0 + ((0 + undef898) + undef899)) + undef900)) /\ ((1 + m^0) <= (0 + l^0)), par{iter^0 -> (1 + iter^0), tmp___2^0 -> (0 + iter^0)}>
<l22, l9, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>
<l22, l9, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, (31 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>
<l22, l9, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>
<l22, l9, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, ((1 + tmp___2^0) <= 30) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>
<l22, l9, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ ((1 + undef552) <= 0) /\ (undef525 = undef525) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>
<l22, l9, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((1 + i^0) <= (0 + l^0)), par{r^0 -> undef560}>
<l22, l13, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ (1 <= (0 + undef455)) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l13, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((1 + undef455) <= 0) /\ (undef329 = undef329) /\ (undef317 = undef317) /\ (undef337 = undef337) /\ (undef328 = undef328) /\ (undef327 = undef327) /\ (undef320 = undef320), par{r^0 -> undef328}>
<l22, l9, ((0 + tmp___2^0) <= 30) /\ (30 <= (0 + tmp___2^0)) /\ (undef552 = undef552) /\ (undef560 = undef560) /\ (0 <= (0 + undef552)) /\ (undef545 = undef545) /\ (undef489 = undef489) /\ (undef486 = 1) /\ ((0 + l^0) <= (0 + i^0)) /\ (undef446 = undef446) /\ (undef443 = undef443) /\ (undef455 = undef455) /\ ((0 + undef455) <= 0) /\ (0 <= (0 + undef455)), par{r^0 -> undef455}>

Fresh variables:
undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 

Undef variables:
undef298, undef317, undef320, undef327, undef328, undef329, undef337, undef443, undef446, undef455, undef486, undef489, undef525, undef545, undef552, undef560, undef898, undef899, undef900, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l6, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0, n^0

Graph 2:
Transitions:
<l9, l15, 1 + l^0 <= n^0 /\ 1 <= r^0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, 1 + l^0 <= n^0 /\ 1 + r^0 <= 0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, 1 + i^0 <= l^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, l^0 <= i^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l13, l9, i^0 <= l^0 /\ 1 + n^0 <= k^0, {i^0 -> -1 + i^0, rest remain the same}>
<l13, l13, 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l13, 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l9, 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ undef455 = 0, {i^0 -> -1 + i^0, r^0 -> undef455, rest remain the same}>
<l13, l13, k^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
<l15, l22, n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, n^0 <= m^0 /\ 1 + m^0 <= l^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l15, 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, 1 + l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ l^0 = m^0 /\ undef900 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l15, l22, 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l6, true, {all remain the same}>

Graph 2
<l6, l15, l^0 <= n^0 /\ 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}>

Graph 3
<l6, l28, 1 + n^0 <= i^0 /\ 1 + n^0 <= l^0, {all remain the same}>
<l9, l28, n^0 <= l^0 /\ 1 <= r^0 /\ l^0 = m^0, {l^0 -> 1 + l^0, rest remain the same}>
<l9, l28, n^0 <= l^0 /\ 1 + r^0 <= 0 /\ l^0 = m^0, {l^0 -> 1 + l^0, rest remain the same}>
<l9, l28, n^0 <= l^0 /\ 1 + i^0 <= l^0 /\ l^0 = m^0 /\ r^0 = 0, {l^0 -> 1 + l^0, rest remain the same}>
<l9, l28, l^0 <= i^0 /\ n^0 <= l^0 /\ l^0 = m^0 /\ r^0 = 0, {l^0 -> 1 + l^0, rest remain the same}>
<l15, l28, n^0 <= l^0 /\ n^0 <= m^0 /\ l^0 = m^0, {l^0 -> 1 + l^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 6 , 1 )
( 9 , 2 )
( 13 , 2 )
( 15 , 2 )
( 22 , 2 )
( 28 , 3 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.001872

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001384s
Ranking function: -i^0 + n^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 1.44096
Some transition disabled by a set of invariant(s):
Invariant at l9: l^0 <= n^0
Invariant at l13: l^0 <= n^0
Invariant at l15: l^0 <= n^0
Invariant at l22: l^0 <= n^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l15, l22, n^0 <= m^0 /\ 1 + m^0 <= l^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, 1 + l^0 <= n^0 /\ 1 <= r^0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, 1 + l^0 <= n^0 /\ 1 + r^0 <= 0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, 1 + i^0 <= l^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= i^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l9, i^0 <= l^0 /\ l^0 <= n^0 /\ 1 + n^0 <= k^0, {i^0 -> -1 + i^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l9, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ undef455 = 0, {i^0 -> -1 + i^0, r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l13, k^0 <= n^0 /\ l^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l15, 1 + l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ l^0 = m^0 /\ undef900 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l15, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Checking unfeasibility...
Time used: 1.62701

Checking conditional termination of SCC {l9, l13, l15, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.061716s
Ranking function: -38 - 35*l^0 - 3*m^0 + 38*n^0
New Graphs: 
Transitions:
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l13, l9, i^0 <= l^0 /\ l^0 <= n^0 /\ 1 + n^0 <= k^0, {i^0 -> -1 + i^0, rest remain the same}>
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l9, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ undef455 = 0, {i^0 -> -1 + i^0, r^0 -> undef455, rest remain the same}>
<l13, l13, k^0 <= n^0 /\ l^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0
Checking conditional termination of SCC {l9, l13, l15, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.042953s
Ranking function: -35 + 35*i^0 - 35*l^0
New Graphs: 
Transitions:
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l13, l9, i^0 <= l^0 /\ l^0 <= n^0 /\ 1 + n^0 <= k^0, {i^0 -> -1 + i^0, rest remain the same}>
<l13, l13, k^0 <= n^0 /\ l^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0
Checking conditional termination of SCC {l9, l13, l15, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.040274s
Ranking function: 2 - k^0 - l^0 + 2*n^0
New Graphs: 
Transitions:
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l15, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0
Checking conditional termination of SCC {l9, l15, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.044326s
Ranking function: -34 - 34*l^0 - 35*m^0 + 69*n^0
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l9, l22, 1 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
New Graphs: 
Transitions:
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ i^0 = l^0 /\ undef486 = 1, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 <= undef455 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0 /\ i^0 = l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, k^0, l^0, m^0, n^0, r^0, tmp___2^0
Checking conditional termination of SCC {l9, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.052855s
Ranking function: -34 + i^0 + 34*k^0 - 33*l^0 - 2*n^0
New Graphs: 
Transitions:
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0
Checking conditional termination of SCC {l9, l22}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022777s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.361623s
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.184664s
Time used: 0.181072
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.110651s
Time used: 0.107007
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.198067s
Time used: 0.194746
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.175094s
Time used: 0.171655
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084731s
Time used: 0.081302
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089734s
Time used: 0.086671
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085388s
Time used: 0.082253
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.089642s
Time used: 0.086617
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092976s
Time used: 0.0899
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096392s
Time used: 0.093249
Trying to remove transition: <l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092946s
Time used: 0.089742
Trying to remove transition: <l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.098158s
Time used: 0.094959
Trying to remove transition: <l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118637s
Time used: 0.115176
Trying to remove transition: <l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.239899s
Time used: 0.236093
Trying to remove transition: <l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.117055s
Time used: 0.112806
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.337262s
Time used: 0.333323
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.251246s
Time used: 0.246838
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.239747s
Time used: 0.235319
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.133215s
Time used: 0.128847
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.183058s
Time used: 0.179074
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.145829s
Time used: 0.141853
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.130572s
Time used: 0.126723
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.327549s
Time used: 0.323661
Trying to remove transition: <l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.326646s
Time used: 0.322235
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006718s
Time used: 4.00126
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.026327s
Time used: 4.00448
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.826870s
Time used: 1.77013
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.095613s
Time used: 4.00002
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l6, l15, l^0 <= n^0 /\ 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l6, l15, l^0 <= n^0 /\ 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST
Postcondition: 1 <= 0

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l0, l6, l^0 <= n^0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011092s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.011227s

LOG: NarrowEntry size 1
Narrowing transition: 
<l6, l6, i^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l6, 0 <= 0 /\ l^0 <= n^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l6, l6, 0 <= 0 /\ i^0 <= n^0 /\ l^0 <= n^0, {i^0 -> 1 + i^0, rest remain the same}>
END GRAPH:
EXIT: <l6, l15, l^0 <= n^0 /\ 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}>
POST: 1 <= 0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041513s
Time used: 0.041216
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.023537s
Time used: 1.01467

LOG: SAT solveNonLinear - Elapsed time: 1.065051s
Cost: 51; Total time: 1.05589
Failed at location 6: 1 + n^0 <= i^0
Before Improving: 
Quasi-invariant at l6: 1 + n^0 <= i^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004242s
Remaining time after improvement: 0.99779
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l6: 1 + n^0 <= i^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:1 + n^0 <= i^0 - Process 3
* Exit transition: <l0, l6, 0 <= 0 /\ l^0 <= n^0, {all remain the same}>
* Postcondition  : 1 + n^0 <= i^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010360s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.010544s
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.210399s
Time used: 0.210054
Improving Solution with cost 51 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008002s
Time used: 1.00774

LOG: SAT solveNonLinear - Elapsed time: 1.218401s
Cost: 51; Total time: 1.21779
Failed at location 6: 1 + n^0 <= i^0
Before Improving: 
Quasi-invariant at l6: 1 + n^0 <= i^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005990s
Remaining time after improvement: 0.997432
Some transition disabled by a set of quasi-invariant(s):
Quasi-invariant at l6: 1 + n^0 <= i^0

LOG: NEXT CALL check - disable

LOG: CALL check - Post:1 + n^0 <= i^0 - Process 4
* Exit transition: <l0, l6, 0 <= 0 /\ l^0 <= n^0, {all remain the same}>
* Postcondition  : 1 + n^0 <= i^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012462s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.012621s
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000298s
Time used: 1.00003

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 3.483651s
Cannot prove unreachability

Proving non-termination of subgraph 2
Transitions:
<l9, l15, 1 + l^0 <= n^0 /\ 1 <= r^0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 <= r^0, {all remain the same}>
<l9, l15, 1 + l^0 <= n^0 /\ 1 + r^0 <= 0 /\ l^0 = m^0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + r^0 <= 0, {all remain the same}>
<l9, l15, 1 + i^0 <= l^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ 1 + l^0 <= n^0 /\ l^0 = m^0 /\ r^0 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {all remain the same}>
<l9, l15, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ r^0 = 0, {all remain the same}>
<l13, l9, i^0 <= l^0 /\ l^0 <= n^0 /\ 1 + n^0 <= k^0, {i^0 -> -1 + i^0, rest remain the same}>
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 <= undef455, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l13, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ 1 + undef455 <= 0, {i^0 -> -1 + i^0, r^0 -> undef328, rest remain the same}>
<l13, l9, l^0 <= n^0 /\ 1 + l^0 <= i^0 /\ 1 + n^0 <= k^0 /\ undef455 = 0, {i^0 -> -1 + i^0, r^0 -> undef455, rest remain the same}>
<l13, l13, k^0 <= n^0 /\ l^0 <= n^0, {k^0 -> 1 + k^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 <= undef900, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ 1 + undef900 <= 0, {m^0 -> 1 + m^0, rest remain the same}>
<l15, l15, 1 + l^0 <= n^0 /\ 1 + m^0 <= n^0 /\ l^0 = m^0 /\ undef900 = 0, {iter^0 -> 0, l^0 -> 1 + l^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l15, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 <= undef455 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef455 <= 0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 <= undef455 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l13, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + undef455 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef328, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
l^0, m^0, n^0, r^0, i^0, k^0, iter^0, tmp___2^0

Checking conditional non-termination of SCC {l9, l13, l15, l22}...
EXIT TRANSITIONS:
<l9, end, 1 <= r^0 /\ l^0 = m^0 /\ l^0 = n^0, {all remain the same}>
<l9, end, r^0 <= 0 /\ l^0 = m^0 /\ l^0 = n^0, {all remain the same}>
<l15, end, m^0 <= l^0 /\ n^0 <= m^0 /\ l^0 = n^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001057s
Time used: 5.00005
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.031645s
Time used: 5.00014
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.058179s
Time used: 5.00137
> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO

Proving non-termination of subgraph 2
Transitions:
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>
Variables:
i^0, iter^0, l^0, m^0, n^0, r^0, tmp___2^0

Checking conditional non-termination of SCC {l9, l22}...
EXIT TRANSITIONS:
<l9, end, m^0 <= l^0 /\ n^0 <= m^0 /\ 1 <= r^0, {all remain the same}>
<l9, end, m^0 <= l^0 /\ n^0 <= m^0 /\ r^0 <= 0, {all remain the same}>
<l9, end, 1 + m^0 <= n^0 /\ 1 <= r^0 /\ l^0 = m^0, {all remain the same}>
<l9, end, r^0 <= 0 /\ 1 + m^0 <= n^0 /\ l^0 = m^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.171790s
Time used: 2.16272

LOG: SAT solveNonLinear - Elapsed time: 2.171790s
Cost: 0; Total time: 2.16272
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.161422s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l9: 1 + l^0 <= m^0
Quasi-invariant at l22: 1 + l^0 <= m^0

Strengthening and disabling EXIT transitions...
Closed exits from l9: 4

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 <= r^0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 <= r^0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ 1 + r^0 <= 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l9, l22, l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ 1 + r^0 <= 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l9, l22, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ n^0 <= m^0 /\ 1 + l^0 <= m^0 /\ r^0 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l9, l22, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + m^0 <= l^0 /\ 1 + m^0 <= n^0 /\ r^0 = 0 /\ undef900 = 0, {iter^0 -> 1 + iter^0, tmp___2^0 -> iter^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 31 <= tmp___2^0 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + l^0 <= m^0 /\ 31 <= tmp___2^0 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ tmp___2^0 <= 29 /\ undef486 = 1, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + l^0 <= m^0 /\ tmp___2^0 <= 29 /\ undef455 = 0 /\ undef486 = 1, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 1 + l^0 <= m^0 /\ 1 + undef552 <= 0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= n^0 /\ 0 <= undef552 /\ 1 + i^0 <= l^0 /\ 1 + l^0 <= m^0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef560, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l22, l9, l^0 <= i^0 /\ l^0 <= n^0 /\ 0 <= undef552 /\ 1 + l^0 <= m^0 /\ undef455 = 0 /\ undef486 = 1 /\ tmp___2^0 = 30, {r^0 -> undef455, rest remain the same}>

Calling reachability with...
Transition: <l15, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l15, end, true, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l6, l15, l^0 <= n^0 /\ 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}>
Conditions: 
OPEN EXITS: 
<l6, l15, 1 + n^0 <= i^0, {iter^0 -> 0, rest remain the same}> (condsUp: l^0 <= n^0)

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l6, true, {all remain the same}>
Conditions: 1 + n^0 <= i^0, l^0 <= n^0, 
OPEN EXITS: 
<l0, l6, l^0 <= n^0 /\ 1 + n^0 <= i^0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate