NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l8, true>
<l1, l2, (undef10 = undef10) /\ (undef9 = undef9), par{x_5^0 -> undef9, y_6^0 -> undef10}>
<l2, l3, (undef22 = (0 + cnt_16^0)) /\ (undef21 = (0 + cnt_21^0)) /\ (((0 + undef21) + (~(1) * undef22)) <= 0) /\ (undef17 = undef17) /\ (undef15 = undef15) /\ (undef11 = undef11), par{Result_4^0 -> undef11, lt_10^0 -> undef15, lt_9^0 -> undef17}>
<l2, l4, (undef34 = (0 + cnt_16^0)) /\ (undef33 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef33) + (~(1) * undef34))) /\ (undef29 = undef29) /\ (undef27 = undef27) /\ (undef30 = undef30) /\ ((0 + undef30) <= 0) /\ (0 <= (0 + undef30)), par{lt_10^0 -> undef27, lt_9^0 -> undef29, tmp_7^0 -> undef30}>
<l4, l2, true>
<l2, l5, (undef56 = (0 + cnt_16^0)) /\ (undef55 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef55) + (~(1) * undef56))) /\ (undef51 = undef51) /\ (undef49 = undef49) /\ (undef52 = undef52), par{lt_10^0 -> undef49, lt_9^0 -> undef51, tmp_7^0 -> undef52}>
<l5, l6, (undef58 = __disjvr_0^0) /\ (__disjvr_0^0 = undef58), par{__disjvr_0^0 -> undef58}>
<l6, l7, (undef77 = (0 + cnt_16^0)) /\ (undef72 = undef72), par{lt_8^0 -> undef72}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 

Undef variables:
undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef10 = undef10) /\ (undef9 = undef9)>
<l2, l3, (undef22 = (0 + cnt_16^0)) /\ (undef21 = (0 + cnt_21^0)) /\ (((0 + undef21) + (~(1) * undef22)) <= 0) /\ (undef17 = undef17) /\ (undef15 = undef15) /\ (undef11 = undef11)>
<l2, l2, (undef34 = (0 + cnt_16^0)) /\ (undef33 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef33) + (~(1) * undef34))) /\ (undef29 = undef29) /\ (undef27 = undef27) /\ (undef30 = undef30) /\ ((0 + undef30) <= 0) /\ (0 <= (0 + undef30))>
<l2, l2, (undef56 = (0 + cnt_16^0)) /\ (undef55 = (0 + cnt_21^0)) /\ (0 <= ((~(1) + undef55) + (~(1) * undef56))) /\ (undef51 = undef51) /\ (undef49 = undef49) /\ (undef52 = undef52) /\ (undef58 = __disjvr_0^0) /\ (__disjvr_0^0 = undef58) /\ (undef77 = (0 + cnt_16^0)) /\ (undef72 = undef72), par{__disjvr_0^0 -> undef58}>

Fresh variables:
undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 

Undef variables:
undef9, undef10, undef11, undef15, undef17, undef21, undef22, undef27, undef29, undef30, undef33, undef34, undef49, undef51, undef52, undef55, undef56, undef58, undef72, undef77, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>
<l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
Variables:
cnt_16^0, cnt_21^0, __disjvr_0^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l3, undef21 <= undef22 /\ cnt_16^0 = undef22 /\ cnt_21^0 = undef21, {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.003081

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000685s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002062s
Trying to remove transition: <l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006621s
Time used: 0.00617
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011497s
Time used: 0.011494

LOG: SAT solveNonLinear - Elapsed time: 0.018118s
Cost: 1; Total time: 0.017664
Failed at location 2: cnt_21^0 <= cnt_16^0
Before Improving: 
Quasi-invariant at l2: cnt_21^0 <= cnt_16^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002292s
Remaining time after improvement: 0.999067
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: cnt_21^0 <= cnt_16^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>
New Graphs: 
Calling Safety with literal cnt_21^0 <= cnt_16^0 and entry <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000254s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: cnt_21^0 <= cnt_16^0 , 
Narrowing transition: 
<l2, l2, 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>
<l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
Variables:
cnt_16^0, cnt_21^0, __disjvr_0^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000391s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001605s
Trying to remove transition: <l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013343s
Time used: 0.00537

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>
<l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>
Variables:
cnt_16^0, cnt_21^0, __disjvr_0^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001520s
Checking conditional non-termination of SCC {l2}...
EXIT TRANSITIONS:
<l2, end, cnt_21^0 <= cnt_16^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036254s
Time used: 0.035829
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031220s
Time used: 0.031216

LOG: SAT solveNonLinear - Elapsed time: 0.067473s
Cost: 1; Total time: 0.067045
Failed at location 2: 1 + cnt_16^0 <= cnt_21^0
Before Improving: 
Quasi-invariant at l2: 1 + cnt_16^0 <= cnt_21^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003974s
Remaining time after improvement: 0.998037
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.004059s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l2: 1 + cnt_16^0 <= cnt_21^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 + cnt_16^0 <= cnt_21^0 /\ 1 + undef34 <= undef33 /\ cnt_16^0 = undef34 /\ cnt_21^0 = undef33 /\ undef30 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + cnt_16^0 <= cnt_21^0 /\ 1 + undef56 <= undef55 /\ __disjvr_0^0 = undef58 /\ cnt_16^0 = undef56 /\ cnt_16^0 = undef77 /\ cnt_21^0 = undef55, {__disjvr_0^0 -> undef58, rest remain the same}>

Calling reachability with...
Transition: <l2, end, true, {all remain the same}>
Conditions: 1 + cnt_16^0 <= cnt_21^0, 
OPEN EXITS: 
<l2, end, true, {all remain the same}> (condsUp: 1 + cnt_16^0 <= cnt_21^0)

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

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

> Conditions are reachable!

Program does NOT terminate