YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, true, par{arg1 -> 0, arg2 -> undef2}>
<l2, l3, (arg1 < 10), par{arg2 -> 3}>
<l3, l2, (arg2 > 11), par{arg1 -> (arg1 + 1), arg2 -> undef6}>
<l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}>
<l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}>

Fresh variables:
undef2, undef6, undef9, undef10, 

Undef variables:
undef2, undef6, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (arg1 = 0) /\ (arg2 = 3) /\ (0 < 10)>
<l3, l3, (arg2 > 11) /\ ((arg1 + 1) < 10), par{arg1 -> (arg1 + 1), arg2 -> 3}>
<l3, l3, (arg2 < 12), par{arg2 -> (arg2 + 1)}>

Fresh variables:
undef2, undef6, undef9, undef10, 

Undef variables:
undef2, undef6, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 12 <= arg2 /\ arg1 <= 8, {arg1 -> 1 + arg1, arg2 -> 3, rest remain the same}>
<l3, l3, arg2 <= 11, {arg2 -> 1 + arg2, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l3, arg1 = 0 /\ arg2 = 3, {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.384166

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001982s
Ranking function: 8 - arg1
New Graphs: 
Transitions:
<l3, l3, arg2 <= 11, {arg2 -> 1 + arg2, rest remain the same}>
Variables:
arg2
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000478s
Ranking function: 11 - arg2
New Graphs: 
Program Terminates