NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l10, true>
<l1, l2, true>
<l3, l4, true>
<l5, l6, true>
<l6, l5, true>
<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
<l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}>
<l2, l5, ((0 + curr_serv^0) <= 0)>
<l8, l5, (6 <= (0 + c^0))>
<l8, l1, ((0 + c^0) <= 5)>
<l9, l8, (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4), par{___rho_2_^0 -> undef62, c^0 -> undef63, curr_serv^0 -> (0 + undef66), resp^0 -> 0, servers^0 -> undef66}>
<l10, l9, true>

Fresh variables:
undef37, undef62, undef63, undef66, 

Undef variables:
undef37, undef62, undef63, undef66, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (c^0 = undef63) /\ (curr_serv^0 = (0 + undef66)) /\ (resp^0 = 0) /\ (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4) /\ (6 <= (0 + undef63))>
<l0, l1, (c^0 = undef63) /\ (curr_serv^0 = (0 + undef66)) /\ (resp^0 = 0) /\ (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4) /\ ((0 + undef63) <= 5)>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
<l1, l5, ((0 + curr_serv^0) <= 0)>
<l5, l5, true>

Fresh variables:
undef37, undef62, undef63, undef66, 

Undef variables:
undef37, undef62, undef63, undef66, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
Variables:
c^0, curr_serv^0, resp^0

Graph 2:
Transitions:
<l5, l5, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= undef63 /\ undef63 <= 5 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>

Graph 2
<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
<l1, l5, curr_serv^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001367s
Ranking function: -1 - c^0 + curr_serv^0
New Graphs: 
Transitions:
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
Variables:
c^0, curr_serv^0, resp^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000718s
Ranking function: -1 + curr_serv^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.000955

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

Proving non-termination of subgraph 2
Transitions:
<l5, l5, true, {all remain the same}>
Variables:

Checking conditional non-termination of SCC {l5}...
> No exit transition to close.
Calling reachability with...
Transition: <l5, end, true, {all remain the same}>
Conditions: 
Transition: <l5, end, true, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l5, end, true, {all remain the same}>
<l5, end, true, {all remain the same}>

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

Calling reachability with...
Transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
Conditions: 
Transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
Conditions: 
OPEN EXITS: 
<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate