YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, ((0 + __const_50^0) <= (0 + i5^0)), par{i^0 -> 0}>
<l1, l3, ((1 + i5^0) <= (0 + __const_50^0)), par{i5^0 -> (1 + i5^0)}>
<l3, l1, true>
<l2, l4, true>
<l4, l5, ((0 + __const_50^0) <= (0 + i^0))>
<l4, l2, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
<l6, l3, (undef28 = undef28) /\ (undef29 = 0), par{i5^0 -> 0, i^0 -> 0, tmp^0 -> undef28}>
<l7, l6, true>

Fresh variables:
undef28, undef29, 

Undef variables:
undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i5^0 = 0) /\ (i^0 = 0) /\ (undef28 = undef28) /\ (undef29 = 0)>
<l2, l5, ((0 + __const_50^0) <= (0 + i^0))>
<l2, l2, ((1 + i^0) <= (0 + __const_50^0)), par{i^0 -> (1 + i^0)}>
<l3, l2, ((0 + __const_50^0) <= (0 + i5^0)), par{i^0 -> 0}>
<l3, l3, ((1 + i5^0) <= (0 + __const_50^0)), par{i5^0 -> (1 + i5^0)}>

Fresh variables:
undef28, undef29, 

Undef variables:
undef28, undef29, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

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

Graph 3:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i5^0 = 0 /\ i^0 = 0 /\ undef29 = 0, {all remain the same}>

Graph 2
<l3, l2, __const_50^0 <= i5^0, {i^0 -> 0, rest remain the same}>

Graph 3
<l2, l5, __const_50^0 <= i^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000764s
Ranking function: -1 + __const_50^0 - i5^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001095

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000524s
Ranking function: -1 + __const_50^0 - i^0
New Graphs: 
Proving termination of subgraph 3
Analyzing SCC {l5}...
No cycles found.

Program Terminates