YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, ((0 + x^0) <= 0), par{x^0 -> 1}>
<l1, l2, (1 <= (0 + x^0)), par{x^0 -> (1 + x^0)}>
<l3, l4, (4 <= (0 + x^0))>
<l3, l1, ((1 + x^0) <= 4)>
<l2, l3, true>
<l5, l2, (undef13 = (0 + __const_5^0)) /\ (undef12 = undef12), par{x^0 -> undef12}>
<l6, l5, true>

Fresh variables:
undef12, undef13, 

Undef variables:
undef12, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (x^0 = undef12) /\ (undef13 = (0 + __const_5^0)) /\ (undef12 = undef12)>
<l2, l4, (4 <= (0 + x^0))>
<l2, l2, ((1 + x^0) <= 4) /\ ((0 + x^0) <= 0), par{x^0 -> 1}>
<l2, l2, ((1 + x^0) <= 4) /\ (1 <= (0 + x^0)), par{x^0 -> (1 + x^0)}>

Fresh variables:
undef12, undef13, 

Undef variables:
undef12, undef13, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, x^0 <= 0, {x^0 -> 1, rest remain the same}>
<l2, l2, 1 <= x^0 /\ x^0 <= 3, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, __const_5^0 = undef13 /\ x^0 = undef12, {all remain the same}>

Graph 2
<l2, l4, 4 <= x^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.002404

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000864s
Ranking function: -4*x^0
New Graphs: 
Transitions:
<l2, l2, 1 <= x^0 /\ x^0 <= 3, {x^0 -> 1 + x^0, rest remain the same}>
Variables:
x^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000428s
Ranking function: 3 - x^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l4}...
No cycles found.

Program Terminates