YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (undef3 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}>
<l2, l3, (arg3 <= arg2) /\ (arg3 > 0), par{arg1 -> arg3, arg2 -> arg1, arg3 -> arg2, arg4 -> arg3, arg5 -> arg3}>
<l3, l3, (arg4 < 0) /\ (arg4 < 1) /\ (arg4 = arg5), par{arg3 -> (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}>
<l3, l3, (arg4 > 0) /\ (arg4 < 1) /\ (arg4 = arg5), par{arg3 -> (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}>
<l3, l3, (arg4 > 0) /\ (arg4 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg4 - 1)}>
<l3, l2, (arg2 > ~(1)) /\ (0 = arg4) /\ (0 = arg5), par{arg1 -> (arg2 + 1), arg2 -> arg3, arg3 -> arg1, arg4 -> undef29, arg5 -> undef30}>
<l4, l1, true, par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}>

Fresh variables:
undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 

Undef variables:
undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (arg1 = undef3) /\ (arg2 = 0) /\ (arg3 = undef2) /\ (arg4 = undef3) /\ (arg5 = undef3) /\ (undef3 > ~(1)) /\ (undef32 > ~(1)) /\ (undef2 > ~(1)) /\ (undef31 > 0) /\ (undef3 <= undef2) /\ (undef3 > 0)>
<l3, l3, (arg4 < 0) /\ (arg4 < 1) /\ (arg4 = arg5), par{arg3 -> (arg3 + 1), arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}>
<l3, l3, (arg4 > 0) /\ (arg4 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg4 - 1)}>
<l3, l3, (arg2 > ~(1)) /\ (0 = arg4) /\ (0 = arg5) /\ (arg1 <= arg3) /\ (arg1 > 0), par{arg1 -> arg1, arg2 -> (arg2 + 1), arg3 -> arg3, arg4 -> arg1, arg5 -> arg1}>

Fresh variables:
undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 

Undef variables:
undef2, undef3, undef4, undef5, undef29, undef30, undef31, undef32, undef33, undef34, undef35, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + arg4 <= 0 /\ arg4 = arg5, {arg3 -> 1 + arg3, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}>
<l3, l3, 1 <= arg4 /\ arg4 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}>
<l3, l3, 1 <= arg1 /\ arg1 <= arg3 /\ 0 <= arg2 /\ arg4 = 0 /\ arg5 = 0, {arg2 -> 1 + arg2, arg4 -> arg1, arg5 -> arg1, rest remain the same}>
Variables:
arg3, arg4, arg5, arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef3 /\ 1 <= undef31 /\ 0 <= undef2 /\ undef3 <= undef2 /\ 0 <= undef32 /\ arg1 = undef3 /\ arg2 = 0 /\ arg3 = undef2 /\ arg4 = undef3 /\ arg5 = undef3, {all remain the same}>

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

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.019195
Some transition disabled by a set of invariant(s):
Invariant at l3: 0 <= arg5

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + arg4 <= 0 /\ arg4 = arg5, {arg3 -> 1 + arg3, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= arg4 /\ 0 <= arg5 /\ arg4 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= arg1 /\ arg1 <= arg3 /\ 0 <= arg2 /\ arg4 = 0 /\ arg5 = 0, {arg2 -> 1 + arg2, arg4 -> arg1, arg5 -> arg1, rest remain the same}>
Checking unfeasibility...
Time used: 0.024206

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001879s
Ranking function: 1 + 2*arg3 - arg4
New Graphs: 
Transitions:
<l3, l3, 1 <= arg4 /\ 0 <= arg5 /\ arg4 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg4, rest remain the same}>
Variables:
arg3, arg4, arg5
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000790s
Ranking function: -1 + arg4
New Graphs: 
Program Terminates