NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef8 = undef8) /\ (undef7 = undef7), par{x_5^0 -> undef7, y_6^0 -> undef8}>
<l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9), par{Result_4^0 -> undef9, lt_8^0 -> undef13, lt_9^0 -> undef14}>
<l2, l4, true, par{lt_8^0 -> (0 + cnt_15^0), lt_9^0 -> (0 + cnt_20^0)}>
<l4, l5, ((1 + lt_8^0) <= (0 + lt_9^0))>
<l4, l5, ((1 + lt_9^0) <= (0 + lt_8^0))>
<l5, l6, (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46), par{lt_7^0 -> undef46, lt_8^0 -> undef47, lt_9^0 -> undef48}>
<l6, l2, true>
<l7, l1, true>

Fresh variables:
undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 

Undef variables:
undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef8 = undef8) /\ (undef7 = undef7)>
<l2, l3, (undef17 = (0 + cnt_15^0)) /\ (undef18 = (0 + cnt_20^0)) /\ ((0 + undef17) <= (0 + undef18)) /\ ((0 + undef18) <= (0 + undef17)) /\ (undef13 = undef13) /\ (undef14 = undef14) /\ (undef9 = undef9)>
<l2, l2, ((1 + (0 + cnt_15^0)) <= (0 + (0 + cnt_20^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)>
<l2, l2, ((1 + (0 + cnt_20^0)) <= (0 + (0 + cnt_15^0))) /\ (undef47 = undef47) /\ (undef48 = undef48) /\ (undef51 = (0 + cnt_15^0)) /\ (undef46 = undef46)>

Fresh variables:
undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 

Undef variables:
undef7, undef8, undef9, undef13, undef14, undef17, undef18, undef46, undef47, undef48, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
Variables:
cnt_15^0, cnt_20^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l2, l3, cnt_15^0 = undef17 /\ cnt_20^0 = undef18 /\ undef17 = undef18, {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.003316

> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal cnt_20^0 <= cnt_15^0 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:cnt_20^0 <= cnt_15^0 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : cnt_20^0 <= cnt_15^0
Postcodition moved up: cnt_20^0 <= cnt_15^0

LOG: Try proving POST
Postcondition: cnt_20^0 <= cnt_15^0

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000338s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
ENTRIES:
<l0, l2, 1 + cnt_15^0 <= cnt_20^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: cnt_20^0 <= cnt_15^0


LOG: Try proving POST
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002357s
Time used: 1.00035

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 5.299136s

Proving non-termination of subgraph 1
Transitions:
<l2, l2, 1 + cnt_15^0 <= cnt_20^0 /\ cnt_15^0 = undef51, {all remain the same}>
<l2, l2, 1 + cnt_20^0 <= cnt_15^0 /\ cnt_15^0 = undef51, {all remain the same}>
Variables:
cnt_15^0, cnt_20^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

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

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.106634s
Time used: 0.106021

LOG: SAT solveNonLinear - Elapsed time: 0.132775s
Cost: 1; Total time: 0.131826
Failed at location 2: 1 + cnt_15^0 <= cnt_20^0
Before Improving: 
Quasi-invariant at l2: 1 + cnt_15^0 <= cnt_20^0
Optimizing invariants...

LOG: CALL solveLinear

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

LOG: CALL solveNonLinear

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

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

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

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

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

> Conditions are reachable!

Program does NOT terminate