NO

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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (y^0 = (0 + x^0)) /\ (1 <= (0 + x^0))>
<l2, l2, (1 <= (0 + y^0)), par{y^0 -> (~(1) + y^0)}>
<l2, l2, (1 <= (0 + x^0)), par{y^0 -> (0 + x^0)}>
<l2, l2, (1 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^0), y^0 -> (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:
<l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}>
<l2, l2, 2 <= x^0, {x^0 -> -1 + x^0, y^0 -> -1 + x^0, rest remain the same}>
Variables:
y^0, x^0

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= x^0 /\ x^0 = y^0, {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.005317

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000862s
Ranking function: x^0
New Graphs: 
Transitions:
<l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000414s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001814s
Trying to remove transition: <l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005260s
Time used: 0.005129
Trying to remove transition: <l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002357s
Time used: 0.002097
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011699s
Time used: 0.011556
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000995s
Time used: 4.00049
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008278s
Time used: 1.00033
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015691s
Time used: 0.010411
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, 1 <= x^0 /\ x^0 = y^0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, 1 <= x^0 /\ x^0 = y^0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000871s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000907s
Cannot prove unreachability

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
<l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}>
<l2, l2, 2 <= x^0, {x^0 -> -1 + x^0, y^0 -> -1 + x^0, rest remain the same}>
Variables:
y^0, x^0

Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, x^0 <= 0 /\ y^0 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003912s
Time used: 0.003848

LOG: SAT solveNonLinear - Elapsed time: 0.003912s
Cost: 0; Total time: 0.003848
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 <= x^0

Strengthening and disabling EXIT transitions...
Closed exits from l2: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= x^0, {y^0 -> x^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 2 <= x^0, {x^0 -> -1 + x^0, y^0 -> -1 + x^0, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 1 <= x^0, 
OPEN EXITS: 
<l2, end, 1 <= x^0, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l2, 1 <= x^0 /\ x^0 = y^0, {all remain the same}>
Conditions: 1 <= x^0, 
OPEN EXITS: 
<l0, l2, 1 <= x^0 /\ x^0 = y^0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate