NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l20, true>
<l1, l2, ((1 + y8^0) <= (0 + x7^0))>
<l1, l2, ((1 + x7^0) <= (0 + y8^0))>
<l1, l3, ((0 + x7^0) <= (0 + y8^0)) /\ ((0 + y8^0) <= (0 + x7^0)), par{ret_foo10^0 -> (0 + x7^0)}>
<l4, l5, true>
<l6, l4, ((0 + i^0) <= 4)>
<l6, l4, (5 <= (0 + i^0))>
<l7, l6, (undef127 = (0 + ret_foo18^0)), par{k^0 -> (0 + undef127), tmp___1^0 -> undef127}>
<l8, l9, ((0 + x15^0) <= 0)>
<l8, l9, (1 <= (0 + x15^0)), par{y16^0 -> ((0 + x15^0) + y16^0)}>
<l10, l7, ((1 + x15^0) <= (0 + i17^0)), par{ret_foo18^0 -> (0 + y16^0)}>
<l10, l8, ((0 + i17^0) <= (0 + x15^0))>
<l2, l11, true>
<l12, l9, ((1 + y16^0) <= (0 + x15^0))>
<l12, l9, ((1 + x15^0) <= (0 + y16^0))>
<l12, l7, ((0 + x15^0) <= (0 + y16^0)) /\ ((0 + y16^0) <= (0 + x15^0)), par{ret_foo18^0 -> (0 + x15^0)}>
<l13, l12, (undef297 = (0 + ret_foo14^0)), par{i17^0 -> 0, j^0 -> (0 + undef297), tmp___0^0 -> undef297, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l15, true>
<l16, l14, ((0 + x11^0) <= 0)>
<l16, l14, (1 <= (0 + x11^0)), par{y12^0 -> ((0 + x11^0) + y12^0)}>
<l15, l13, ((1 + x11^0) <= (0 + i13^0)), par{ret_foo14^0 -> (0 + y12^0)}>
<l15, l16, ((0 + i13^0) <= (0 + x11^0))>
<l17, l14, ((1 + y12^0) <= (0 + x11^0))>
<l17, l14, ((1 + x11^0) <= (0 + y12^0))>
<l17, l13, ((0 + x11^0) <= (0 + y12^0)) /\ ((0 + y12^0) <= (0 + x11^0)), par{ret_foo14^0 -> (0 + x11^0)}>
<l9, l10, true>
<l3, l17, (undef486 = (0 + ret_foo10^0)), par{i13^0 -> 0, i^0 -> (0 + undef486), tmp^0 -> undef486, x11^0 -> ~(3), y12^0 -> 4}>
<l18, l2, ((0 + x7^0) <= 0)>
<l18, l2, (1 <= (0 + x7^0)), par{y8^0 -> ((0 + x7^0) + y8^0)}>
<l11, l3, ((1 + x7^0) <= (0 + i9^0)), par{ret_foo10^0 -> (0 + y8^0)}>
<l11, l18, ((0 + i9^0) <= (0 + x7^0))>
<l19, l1, true, par{i9^0 -> 0, x7^0 -> 3, y8^0 -> 3}>
<l20, l19, true>

Fresh variables:
undef127, undef297, undef486, 

Undef variables:
undef127, undef297, undef486, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l14, (0 = 0) /\ (3 = 3) /\ (y8^0 = 3) /\ ((0 + 3) <= (0 + 3)) /\ ((0 + 3) <= (0 + 3)) /\ (undef486 = (0 + (0 + 3))) /\ ((1 + ~(3)) <= (0 + 4)), par{i13^0 -> 0, i^0 -> (0 + undef486), x11^0 -> ~(3), y12^0 -> 4}>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef127 = (0 + (0 + y16^0))) /\ ((0 + i^0) <= 4)>
<l9, l5, ((1 + x15^0) <= (0 + i17^0)) /\ (undef127 = (0 + (0 + y16^0))) /\ (5 <= (0 + i^0))>
<l9, l9, ((0 + i17^0) <= (0 + x15^0)) /\ ((0 + x15^0) <= 0)>
<l9, l9, ((0 + i17^0) <= (0 + x15^0)) /\ (1 <= (0 + x15^0)), par{y16^0 -> ((0 + x15^0) + y16^0)}>
<l14, l9, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((1 + (0 + (~(1) * __const_6^0))) <= (0 + 3)), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l9, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((1 + 3) <= (0 + (0 + (~(1) * __const_6^0)))), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l5, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((0 + 3) <= (0 + (0 + (~(1) * __const_6^0)))) /\ ((0 + (0 + (~(1) * __const_6^0))) <= (0 + 3)) /\ (undef127 = (0 + (0 + 3))) /\ ((0 + i^0) <= 4), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l5, ((1 + x11^0) <= (0 + i13^0)) /\ (undef297 = (0 + (0 + y12^0))) /\ ((0 + 3) <= (0 + (0 + (~(1) * __const_6^0)))) /\ ((0 + (0 + (~(1) * __const_6^0))) <= (0 + 3)) /\ (undef127 = (0 + (0 + 3))) /\ (5 <= (0 + i^0)), par{i17^0 -> 0, x15^0 -> 3, y16^0 -> (0 + (~(1) * __const_6^0))}>
<l14, l14, ((0 + i13^0) <= (0 + x11^0)) /\ ((0 + x11^0) <= 0)>
<l14, l14, ((0 + i13^0) <= (0 + x11^0)) /\ (1 <= (0 + x11^0)), par{y12^0 -> ((0 + x11^0) + y12^0)}>

Fresh variables:
undef127, undef297, undef486, 

Undef variables:
undef127, undef297, undef486, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l14, l14, i13^0 <= x11^0 /\ x11^0 <= 0, {all remain the same}>
<l14, l14, 1 <= x11^0 /\ i13^0 <= x11^0, {y12^0 -> x11^0 + y12^0, rest remain the same}>
Variables:
i13^0, x11^0, y12^0

Graph 2:
Transitions:
<l9, l9, i17^0 <= x15^0 /\ x15^0 <= 0, {all remain the same}>
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>

Graph 2
<l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
<l14, l9, 1 + x11^0 <= i13^0 /\ 4 + __const_6^0 <= 0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

Graph 3
<l9, l5, 1 + x15^0 <= i17^0 /\ i^0 <= 4 /\ y16^0 = undef127, {all remain the same}>
<l9, l5, 1 + x15^0 <= i17^0 /\ 5 <= i^0 /\ y16^0 = undef127, {all remain the same}>
<l14, l5, 1 + x11^0 <= i13^0 /\ i^0 <= 4 /\ y12^0 = undef297 /\ 3 + __const_6^0 = 0 /\ undef127 = 3, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
<l14, l5, 1 + x11^0 <= i13^0 /\ 5 <= i^0 /\ y12^0 = undef297 /\ 3 + __const_6^0 = 0 /\ undef127 = 3, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 5 , 3 )
( 9 , 2 )
( 14 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.005606
Some transition disabled by a set of invariant(s):
Invariant at l14: 1 + x11^0 <= 0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l14, 1 <= x11^0 /\ i13^0 <= x11^0, {y12^0 -> x11^0 + y12^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l14, l14, 1 + x11^0 <= 0 /\ i13^0 <= x11^0, {all remain the same}>
Checking unfeasibility...
Time used: 0.002838
Some transition disabled by a set of invariant(s):
Invariant at l14: 0 <= i13^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l14, l14, 1 + x11^0 <= 0 /\ i13^0 <= x11^0, {all remain the same}>
Checking unfeasibility...
Time used: 4.9e-05

Analyzing SCC {l14}...
No cycles found.

Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.005355
Some transition disabled by a set of invariant(s):
Invariant at l9: 1 <= x15^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l9, l9, i17^0 <= x15^0 /\ x15^0 <= 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Checking unfeasibility...
Time used: 0.002725

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000786s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001990s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015296s
Time used: 0.010746
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017985s
Time used: 0.01798

LOG: SAT solveNonLinear - Elapsed time: 0.033281s
Cost: 1; Total time: 0.028726
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= 1 + i17^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000727s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002893s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015609s
Time used: 0.010728
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016755s
Time used: 0.01675

LOG: SAT solveNonLinear - Elapsed time: 0.032364s
Cost: 1; Total time: 0.027478
Quasi-ranking function: 50000 + i17^0 + 50001*x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000865s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004486s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016587s
Time used: 0.011552
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012744s
Time used: 0.012739

LOG: SAT solveNonLinear - Elapsed time: 0.029331s
Cost: 1; Total time: 0.024291
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= 1 + i17^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - i17^0 + 50004*x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001005s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003881s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018028s
Time used: 0.013023
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017234s
Time used: 0.017229

LOG: SAT solveNonLinear - Elapsed time: 0.035262s
Cost: 1; Total time: 0.030252
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= 1 + i17^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 + i17^0 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001130s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005487s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018693s
Time used: 0.013469
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021407s
Time used: 0.021401

LOG: SAT solveNonLinear - Elapsed time: 0.040099s
Cost: 1; Total time: 0.03487
Termination implied by a set of invariant(s):
Invariant at l9: 1 <= x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - i17^0 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001266s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006865s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018796s
Time used: 0.01368
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019140s
Time used: 0.019135

LOG: SAT solveNonLinear - Elapsed time: 0.037936s
Cost: 1; Total time: 0.032815
Termination implied by a set of invariant(s):
Invariant at l9: 1 <= x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001322s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007607s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020519s
Time used: 0.015575
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014522s
Time used: 0.014513

LOG: SAT solveNonLinear - Elapsed time: 0.035042s
Cost: 1; Total time: 0.030088
Quasi-ranking function: 50000 + x15^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001437s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008945s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020386s
Time used: 0.015486
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018061s
Time used: 0.018053

LOG: SAT solveNonLinear - Elapsed time: 0.038447s
Cost: 1; Total time: 0.033539
Termination implied by a set of invariant(s):
Invariant at l9: 1 <= x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 + i17^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001516s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010222s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020988s
Time used: 0.016731
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020327s
Time used: 0.020322

LOG: SAT solveNonLinear - Elapsed time: 0.041315s
Cost: 1; Total time: 0.037053
Termination implied by a set of invariant(s):
Invariant at l9: 0 <= i17^0 + x15^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= i17^0 + x15^0 /\ 0 <= 1 + i17^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= i17^0 + x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Quasi-ranking function: 50000 - i17^0 - y16^0
New Graphs: 
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= i17^0 + x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0
Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001682s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009403s
Trying to remove transition: <l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0 /\ 0 <= i17^0 + x15^0 /\ 0 <= 1 + i17^0 /\ 50001 + i17^0 <= x15^0 + y16^0 /\ 50001 + i17^0 + 50001*x15^0 <= y16^0 /\ 50001 + i17^0 <= y16^0 /\ 50001 <= i17^0 + x15^0 + y16^0 /\ 50001 + 50004*x15^0 <= i17^0 + y16^0 /\ 50001 <= i17^0 + y16^0 /\ 50001 + x15^0 <= y16^0 /\ 50001 <= x15^0 + y16^0 /\ 50001 <= y16^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021056s
Time used: 0.016328
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^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, l14, 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.001653s

LOG: NarrowEntry size 1
ENTRIES:
<l0, l14, 0 <= 0 /\ 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
END ENTRIES:
GRAPH:
END GRAPH:
EXIT: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^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.004835s
Time used: 0.004732
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010169s
Time used: 0.009965

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

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

Proving non-termination of subgraph 2
Transitions:
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>
Variables:
i17^0, x15^0, y16^0

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010038s
Time used: 0.009934

LOG: SAT solveNonLinear - Elapsed time: 0.010038s
Cost: 0; Total time: 0.009934
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l9: i17^0 <= x15^0

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l9, l9, 1 <= x15^0 /\ i17^0 <= x15^0, {y16^0 -> x15^0 + y16^0, rest remain the same}>

Calling reachability with...
Transition: <l9, end, true, {all remain the same}>
Conditions: i17^0 <= x15^0, 
Transition: <l9, end, true, {all remain the same}>
Conditions: i17^0 <= x15^0, 
OPEN EXITS: 
<l9, end, true, {all remain the same}> (condsUp: i17^0 <= x15^0)
<l9, end, true, {all remain the same}> (condsUp: i17^0 <= x15^0)

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

Calling reachability with...
Transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
Conditions: i17^0 <= x15^0, 
Transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 4 + __const_6^0 <= 0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
Conditions: i17^0 <= x15^0, 
Transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 0 <= 2 + __const_6^0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
Conditions: i17^0 <= x15^0, 
Transition: <l14, l9, 1 + x11^0 <= i13^0 /\ 4 + __const_6^0 <= 0 /\ y12^0 = undef297, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}>
Conditions: i17^0 <= x15^0, 
OPEN EXITS: 
<l14, l9, true, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}> (condsUp: 1 + x11^0 <= i13^0, 0 <= 2 + __const_6^0, y12^0 = undef297, 0 <= 1)
<l14, l9, true, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}> (condsUp: 1 + x11^0 <= i13^0, 4 + __const_6^0 <= 0, y12^0 = undef297, 0 <= 1)
<l14, l9, true, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}> (condsUp: 1 + x11^0 <= i13^0, 0 <= 2 + __const_6^0, y12^0 = undef297, 0 <= 1)
<l14, l9, true, {i17^0 -> 0, x15^0 -> 3, y16^0 -> -__const_6^0, rest remain the same}> (condsUp: 1 + x11^0 <= i13^0, 4 + __const_6^0 <= 0, y12^0 = undef297, 0 <= 1)

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

Calling reachability with...
Transition: <l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
Conditions: 1 + x11^0 <= i13^0, 0 <= 2 + __const_6^0, y12^0 = undef297, 0 <= 1, 
Transition: <l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
Conditions: 1 + x11^0 <= i13^0, 4 + __const_6^0 <= 0, y12^0 = undef297, 0 <= 1, 
Transition: <l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
Conditions: 1 + x11^0 <= i13^0, 0 <= 2 + __const_6^0, y12^0 = undef297, 0 <= 1, 
Transition: <l0, l14, y8^0 = 3 /\ undef486 = 3, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
Conditions: 1 + x11^0 <= i13^0, 4 + __const_6^0 <= 0, y12^0 = undef297, 0 <= 1, 
OPEN EXITS: 
<l0, l14, 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
<l0, l14, 4 + __const_6^0 <= 0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
<l0, l14, 0 <= 2 + __const_6^0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>
<l0, l14, 4 + __const_6^0 <= 0 /\ y8^0 = 3 /\ undef486 = 3 /\ undef297 = 4, {i13^0 -> 0, i^0 -> undef486, x11^0 -> -3, y12^0 -> 4, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate