YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l5, true>
<l1, l2, ((1 + y_13^0) <= 1), par{rt_11^0 -> (0 + st_14^0)}>
<l1, l3, (1 <= (0 + y_13^0))>
<l3, l2, ((0 + x_15^0) <= 0), par{rt_11^0 -> (0 + st_14^0)}>
<l3, l4, (1 <= (0 + x_15^0)), par{x_15^0 -> ((0 + x_15^0) + (~(1) * y_13^0)), y_13^0 -> (1 + y_13^0)}>
<l4, l3, true>
<l5, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, ((1 + y_13^0) <= 1)>
<l0, l3, (1 <= (0 + y_13^0))>
<l3, l2, ((0 + x_15^0) <= 0)>
<l3, l3, (1 <= (0 + x_15^0)), par{x_15^0 -> ((0 + x_15^0) + (~(1) * y_13^0)), y_13^0 -> (1 + y_13^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 <= x_15^0, {x_15^0 -> x_15^0 - y_13^0, y_13^0 -> 1 + y_13^0, rest remain the same}>
Variables:
x_15^0, y_13^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= y_13^0, {all remain the same}>

Graph 2
<l0, l2, y_13^0 <= 0, {all remain the same}>
<l3, l2, x_15^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000674s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001507s
Trying to remove transition: <l3, l3, 1 <= x_15^0, {x_15^0 -> x_15^0 - y_13^0, y_13^0 -> 1 + y_13^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003462s
Time used: 0.003276

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= x_15^0 /\ 1 <= y_13^0, {x_15^0 -> x_15^0 - y_13^0, y_13^0 -> 1 + y_13^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): 
<l3, l3, 1 <= x_15^0 /\ 1 <= y_13^0, {x_15^0 -> x_15^0 - y_13^0, y_13^0 -> 1 + y_13^0, rest remain the same}>
Ranking function: x_15^0
New Graphs: 
INVARIANTS: 
3: 1 <= y_13^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates