NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef9 = undef9) /\ (undef8 = undef8), par{x_5^0 -> undef8, y_6^0 -> undef9}>
<l2, l3, (undef19 = (0 + cnt_15^0)) /\ (undef20 = (0 + cnt_20^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef10 = undef10), par{Result_4^0 -> undef10, lt_8^0 -> undef15, lt_9^0 -> undef16}>
<l2, l4, true, par{lt_8^0 -> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}>
<l4, l5, (undef31 = __disjvr_0^0) /\ (__disjvr_0^0 = undef31), par{__disjvr_0^0 -> undef31}>
<l5, l6, (undef44 = undef44) /\ (undef45 = undef45) /\ (undef48 = (0 + cnt_15^0)) /\ (undef43 = undef43), par{lt_7^0 -> undef43, lt_8^0 -> undef44, lt_9^0 -> undef45}>
<l6, l2, true>
<l7, l1, true>

Fresh variables:
undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 

Undef variables:
undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef9 = undef9) /\ (undef8 = undef8)>
<l2, l3, (undef19 = (0 + cnt_15^0)) /\ (undef20 = (0 + cnt_20^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef10 = undef10)>
<l2, l2, (undef31 = __disjvr_0^0) /\ (__disjvr_0^0 = undef31) /\ (undef44 = undef44) /\ (undef45 = undef45) /\ (undef48 = (0 + cnt_15^0)) /\ (undef43 = undef43), par{__disjvr_0^0 -> undef31}>

Fresh variables:
undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 

Undef variables:
undef8, undef9, undef10, undef15, undef16, undef19, undef20, undef31, undef43, undef44, undef45, undef48, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
Variables:
__disjvr_0^0, cnt_15^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, cnt_15^0 = undef19 /\ cnt_20^0 = undef20 /\ undef19 = undef20, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000512s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001252s
Trying to remove transition: <l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003710s
Time used: 0.002133
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 1
Transitions:
<l2, l2, __disjvr_0^0 = undef31 /\ cnt_15^0 = undef48, {__disjvr_0^0 -> undef31, rest remain the same}>
Variables:
__disjvr_0^0, cnt_15^0

Checking conditional non-termination of SCC {l2}...
> No exit transition to close.
Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000654s
Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l2, end, true, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l2, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l2, true, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate