/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l9, 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)) /\ (undef43 = undef43), par{__rho_1_^0 -> undef43}>
<l2, l5, ((0 + curr_serv^0) <= 0)>
<l8, l1, (undef63 = undef63) /\ (undef58 = (0 + undef63)) /\ (1 <= (0 + undef58)) /\ (undef61 = undef61) /\ (1 <= (0 + undef61)) /\ (undef62 = undef62) /\ ((1 + (2 * undef62)) <= (0 + undef61)) /\ ((0 + undef61) <= (1 + (2 * undef62))), par{c^0 -> undef58, curr_serv^0 -> (0 + undef61), resp^0 -> 0, servers^0 -> undef61, serversdiv2^0 -> undef62, tmp1^0 -> undef63}>
<l9, l8, true>

Fresh variables:
undef43, undef58, undef61, undef62, undef63, 

Undef variables:
undef43, undef58, undef61, undef62, undef63, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (c^0 = undef58) /\ (curr_serv^0 = (0 + undef61)) /\ (resp^0 = 0) /\ (undef63 = undef63) /\ (undef58 = (0 + undef63)) /\ (1 <= (0 + undef58)) /\ (undef61 = undef61) /\ (1 <= (0 + undef61)) /\ (undef62 = undef62) /\ ((1 + (2 * undef62)) <= (0 + undef61)) /\ ((0 + undef61) <= (1 + (2 * undef62)))>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef43 = undef43) /\ ((0 + undef43) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef43 = undef43) /\ (1 <= (0 + undef43)), 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:
undef43, undef58, undef61, undef62, undef63, 

Undef variables:
undef43, undef58, undef61, undef62, undef63, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, undef43 <= 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 <= undef43, {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 <= undef58 /\ 1 <= undef61 /\ c^0 = undef58 /\ curr_serv^0 = undef61 /\ resp^0 = 0 /\ undef58 = undef63 /\ undef61 = 1 + 2*undef62, {all remain the same}>

Graph 2
<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.005708

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001333s
Ranking function: -1 - c^0 + curr_serv^0
New Graphs: 
Transitions:
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef43, {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.000713s
Ranking function: -1 + curr_serv^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.000847

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l1, l5, curr_serv^0 <= 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
* Postcondition  : 1 <= 0
Postcodition moved up: 1 <= 0

LOG: Try proving POST

LOG: CALL check - Post:1 <= 0 - Process 2
* Exit transition: <l0, l1, 1 <= undef58 /\ 1 <= undef61 /\ c^0 = undef58 /\ curr_serv^0 = undef61 /\ resp^0 = 0 /\ undef58 = undef63 /\ undef61 = 1 + 2*undef62, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000807s

LOG: NarrowEntry size 1
Narrowing transition: 
<l1, l1, undef43 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef43, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l1, 0 <= 0 /\ 1 <= undef58 /\ 1 <= undef61 /\ c^0 = undef58 /\ curr_serv^0 = undef61 /\ resp^0 = 0 /\ undef58 = undef63 /\ undef61 = 1 + 2*undef62, {all remain the same}>
END ENTRIES:
GRAPH:
<l1, l1, 0 <= 0 /\ undef43 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
<l1, l1, 0 <= 0 /\ 1 <= curr_serv^0 /\ 1 <= undef43, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
END GRAPH:
EXIT: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
POST: 1 <= 0


LOG: Try proving POST
[26904 : 26905]
[26904 : 26906]
[26904 : 26907]

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

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

[26904 : 26908]
[26904 : 26909]
Successful child: 26909

Program does NOT terminate