NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, (undef2 = 0) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 0), par{i_13^0 -> undef2}>
<l3, l2, ((1 + i_13^0) <= 10) /\ (undef11 = (~(1) + i_13^0)) /\ (undef7 = undef7) /\ (~(1) <= (0 + undef7)) /\ ((0 + undef7) <= ~(1)) /\ (undef6 = undef6) /\ ((0 + undef6) <= (0 + undef7)) /\ ((0 + undef7) <= (0 + undef6)), par{a_19^0 -> undef6, i_13^0 -> undef7}>
<l2, l4, (10 <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}>
<l2, l5, (undef19 = undef19) /\ ((1 + i_13^0) <= 10) /\ (undef18 = (~(1) + i_13^0)) /\ ((0 + undef18) <= (~(1) + undef19)) /\ ((~(1) + undef19) <= (0 + undef18)) /\ ((1 + undef19) <= 10), par{i_13^0 -> undef18, i_20^0 -> undef19}>
<l5, l2, true>
<l6, l1, true>

Fresh variables:
undef2, undef6, undef7, undef11, undef18, undef19, 

Undef variables:
undef2, undef6, undef7, undef11, undef18, undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (i_13^0 = undef2) /\ (undef2 = 0) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 0)>
<l2, l4, (10 <= (0 + i_13^0))>
<l2, l2, (undef19 = undef19) /\ ((1 + i_13^0) <= 10) /\ (undef18 = (~(1) + i_13^0)) /\ ((0 + undef18) <= (~(1) + undef19)) /\ ((~(1) + undef19) <= (0 + undef18)) /\ ((1 + undef19) <= 10), par{i_13^0 -> undef18}>

Fresh variables:
undef2, undef6, undef7, undef11, undef18, undef19, 

Undef variables:
undef2, undef6, undef7, undef11, undef18, undef19, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Variables:
i_13^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>

Graph 2
<l2, l4, 10 <= i_13^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 4 , 2 )

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000673s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001998s
Trying to remove transition: <l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.007329s
Time used: 1.00062

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, 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): 
<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Quasi-ranking function: 50000 + i_13^0
New Graphs: 
Transitions:
<l2, l2, undef19 <= 9 /\ 50001 + i_13^0 <= 0 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Variables:
i_13^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000355s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001383s
Trying to remove transition: <l2, l2, undef19 <= 9 /\ 50001 + i_13^0 <= 0 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.013738s
Time used: 4.00109
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, i_13^0 <= 9 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>
Variables:
i_13^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000588s
Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, 10 <= i_13^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011013s
Time used: 0.010942

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

LOG: CALL solveNonLinear

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

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: i_13^0 <= 0

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

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, i_13^0 <= 0 /\ undef19 <= 9 /\ 1 + undef18 = undef19 /\ i_13^0 = 1 + undef18, {i_13^0 -> undef18, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: i_13^0 <= 0, 
OPEN EXITS: 
<l2, end, i_13^0 <= 0, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l2, i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>
Conditions: i_13^0 <= 0, 
OPEN EXITS: 
<l0, l2, i_13^0 <= 0 /\ i_13^0 = undef2 /\ undef2 = 0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate