YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
<l3, l2, (arg1 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
<l2, l4, (undef13 > 0) /\ (undef11 > ~(1)) /\ (undef9 <= arg1) /\ (arg1 >= undef10) /\ (arg1 > ~(1)) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> (undef13 + 1)}>
<l4, l5, (undef14 <= arg1) /\ (arg3 < 2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef14 > ~(1)) /\ ((undef15 + 2) <= arg2), par{arg1 -> undef14, arg2 -> undef15, arg3 -> arg4, arg4 -> undef17}>
<l4, l4, (undef18 <= arg1) /\ (arg3 > 1) /\ ((undef19 + 1) <= arg2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef18 > ~(1)) /\ (undef19 > ~(1)), par{arg1 -> undef18, arg2 -> undef19, arg3 -> (arg3 - 1)}>
<l5, l6, (undef24 > ~(1)) /\ (arg3 > 0) /\ (arg2 > 0) /\ ((undef22 + 1) <= arg1) /\ ((undef23 + 1) <= arg1) /\ (arg1 > 0) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (arg3 + 1)}>
<l6, l5, (undef26 <= arg1) /\ (arg3 < 2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef26 > ~(1)) /\ ((undef27 + 2) <= arg2), par{arg1 -> undef26, arg2 -> undef27, arg3 -> arg4, arg4 -> undef29}>
<l6, l6, (undef30 <= arg1) /\ (arg3 > 1) /\ ((undef31 + 1) <= arg2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef30 > ~(1)) /\ (undef31 > ~(1)), par{arg1 -> undef30, arg2 -> undef31, arg3 -> (arg3 - 1)}>
<l6, l5, (undef34 <= arg1) /\ (arg3 < 2) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef34 > ~(1)), par{arg1 -> undef34, arg2 -> 0, arg3 -> arg4, arg4 -> undef37}>
<l6, l5, (undef38 <= arg1) /\ (arg3 > 1) /\ (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef38 > ~(1)), par{arg1 -> undef38, arg2 -> 0, arg3 -> arg4, arg4 -> undef41}>
<l3, l7, (arg2 > ~(1)) /\ (undef42 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef42, arg2 -> 1, arg3 -> undef44, arg4 -> undef45}>
<l7, l7, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1), arg3 -> undef48, arg4 -> undef49}>
<l8, l3, true, par{arg1 -> undef50, arg2 -> undef51, arg3 -> undef52, arg4 -> undef53}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef13, undef14, undef15, undef17, undef18, undef19, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef34, undef37, undef38, undef41, undef42, undef44, undef45, undef48, undef49, undef50, undef51, undef52, undef53, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef13, undef14, undef15, undef17, undef18, undef19, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef34, undef37, undef38, undef41, undef42, undef44, undef45, undef48, undef49, undef50, undef51, undef52, undef53, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef50 > 0) /\ (undef5 > ~(1)) /\ (undef13 > 0) /\ (undef11 > ~(1)) /\ (undef9 <= undef5) /\ (undef5 >= undef10) /\ (undef5 > ~(1)) /\ (undef9 > ~(1)) /\ (undef10 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> (undef13 + 1)}>
<l0, l7, (undef51 > ~(1)) /\ (undef42 > ~(1)) /\ (undef50 > 0), par{arg1 -> undef42, arg2 -> 1, arg3 -> undef44, arg4 -> undef45}>
<l4, l6, (undef14 <= arg1) /\ (arg3 < 2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef14 > ~(1)) /\ ((undef15 + 2) <= arg2) /\ (undef24 > ~(1)) /\ (arg4 > 0) /\ (undef15 > 0) /\ ((undef22 + 1) <= undef14) /\ ((undef23 + 1) <= undef14) /\ (undef14 > 0) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (arg4 + 1)}>
<l4, l4, (undef18 <= arg1) /\ (arg3 > 1) /\ ((undef19 + 1) <= arg2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef18 > ~(1)) /\ (undef19 > ~(1)), par{arg1 -> undef18, arg2 -> undef19, arg3 -> (arg3 - 1)}>
<l6, l6, (undef26 <= arg1) /\ (arg3 < 2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef26 > ~(1)) /\ ((undef27 + 2) <= arg2) /\ (undef24 > ~(1)) /\ (arg4 > 0) /\ (undef27 > 0) /\ ((undef22 + 1) <= undef26) /\ ((undef23 + 1) <= undef26) /\ (undef26 > 0) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (arg4 + 1)}>
<l6, l6, (undef30 <= arg1) /\ (arg3 > 1) /\ ((undef31 + 1) <= arg2) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ (undef30 > ~(1)) /\ (undef31 > ~(1)), par{arg1 -> undef30, arg2 -> undef31, arg3 -> (arg3 - 1)}>
<l7, l7, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1), arg3 -> undef48, arg4 -> undef49}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef13, undef14, undef15, undef17, undef18, undef19, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef34, undef37, undef38, undef41, undef42, undef44, undef45, undef48, undef49, undef50, undef51, undef52, undef53, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef13, undef14, undef15, undef17, undef18, undef19, undef22, undef23, undef24, undef26, undef27, undef29, undef30, undef31, undef34, undef37, undef38, undef41, undef42, undef44, undef45, undef48, undef49, undef50, undef51, undef52, undef53, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, 1 <= arg1 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, arg3 -> undef48, arg4 -> undef49, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 2:
Transitions:
<l4, l4, 1 <= arg2 /\ 1 + undef19 <= arg2 /\ 0 <= arg1 /\ undef18 <= arg1 /\ 0 <= undef18 /\ 0 <= undef19 /\ 2 <= arg3, {arg1 -> undef18, arg2 -> undef19, arg3 -> -1 + arg3, rest remain the same}>
Variables:
arg1, arg2, arg3

Graph 3:
Transitions:
<l6, l6, 1 <= arg2 /\ 1 <= arg4 /\ 1 + undef22 <= undef26 /\ 1 + undef23 <= undef26 /\ 1 <= undef26 /\ 1 <= undef27 /\ arg3 <= 1 /\ 0 <= arg1 /\ undef26 <= arg1 /\ 0 <= undef22 /\ 0 <= undef23 /\ 0 <= undef24 /\ 2 + undef27 <= arg2, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> 1 + arg4, rest remain the same}>
<l6, l6, 1 <= arg2 /\ 1 + undef31 <= arg2 /\ 0 <= arg1 /\ undef30 <= arg1 /\ 0 <= undef30 /\ 0 <= undef31 /\ 2 <= arg3, {arg1 -> undef30, arg2 -> undef31, arg3 -> -1 + arg3, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Precedence: 
Graph 0

Graph 1
<l0, l7, 1 <= undef50 /\ 0 <= undef42 /\ 0 <= undef51, {arg1 -> undef42, arg2 -> 1, arg3 -> undef44, arg4 -> undef45, rest remain the same}>

Graph 2
<l0, l4, 1 <= undef13 /\ 1 <= undef50 /\ 0 <= undef5 /\ undef9 <= undef5 /\ undef10 <= undef5 /\ 0 <= undef9 /\ 0 <= undef10 /\ 0 <= undef11, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> 1 + undef13, rest remain the same}>

Graph 3
<l4, l6, 1 <= arg2 /\ 1 <= arg4 /\ 1 <= undef14 /\ 1 + undef22 <= undef14 /\ 1 + undef23 <= undef14 /\ 1 <= undef15 /\ arg3 <= 1 /\ 0 <= arg1 /\ undef14 <= arg1 /\ 0 <= undef22 /\ 0 <= undef23 /\ 0 <= undef24 /\ 2 + undef15 <= arg2, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> 1 + arg4, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 2 )
( 6 , 3 )
( 7 , 1 )

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

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

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000671s
Ranking function: -1 + arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001511

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000675s
Ranking function: -1 + arg2
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 0.004902

Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001656s
Ranking function: arg1
New Graphs: 
Transitions:
<l6, l6, 1 <= arg2 /\ 1 + undef31 <= arg2 /\ 0 <= arg1 /\ undef30 <= arg1 /\ 0 <= undef30 /\ 0 <= undef31 /\ 2 <= arg3, {arg1 -> undef30, arg2 -> undef31, arg3 -> -1 + arg3, rest remain the same}>
Variables:
arg1, arg2, arg3
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

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