YES

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0))>
<l2, l1, true, par{x^0 -> (~(1) + x^0)}>
<l3, l2, true, par{y^0 -> (~(1) + y^0)}>
<l3, l1, true>
<l4, l3, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true, par{x^0 -> (~(1) + x^0), y^0 -> (~(1) + y^0)}>
<l0, l1, true>
<l1, l1, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)), par{x^0 -> (~(1) + x^0)}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {x^0 -> -1 + x^0, y^0 -> -1 + y^0, rest remain the same}>
<l0, l1, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000656s
Ranking function: -1 + x^0
New Graphs: 
Program Terminates