YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
<l2, l2, (arg2 > arg1), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg2 < arg1), par{arg2 -> (arg2 + 1)}>
<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>

Fresh variables:
undef1, undef2, undef7, undef8, 

Undef variables:
undef1, undef2, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (undef2 > ~(1)) /\ (undef8 > ~(1)) /\ (undef1 > ~(1)) /\ (undef7 > 0)>
<l2, l2, (arg2 > arg1), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg2 < arg1), par{arg2 -> (arg2 + 1)}>

Fresh variables:
undef1, undef2, undef7, undef8, 

Undef variables:
undef1, undef2, undef7, undef8, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 1 + arg2 <= arg1, {arg2 -> 1 + arg2, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef7 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef8 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001161s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007812s
Trying to remove transition: <l2, l2, 1 + arg2 <= arg1, {arg2 -> 1 + arg2, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004785s
Time used: 0.004644

LOG: SAT solveNonLinear - Elapsed time: 0.004785s
Cost: 0; Total time: 0.004644
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: arg2 <= arg1
Ranking function: arg1 - arg2
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l2, l2, 1 + arg1 <= arg2, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000369s
Ranking function: -1 - arg1 + arg2
New Graphs: 
Program Terminates