/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, l5, true>
<l1, l2, (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1}>
<l2, l3, true, par{deltaext^0 -> (0 + deltaext_new^0)}>
<l3, l1, ((~(1) + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)) /\ (((0 + c0^0) + wnt^0) <= (0 + (2 * deltaext^0))), par{deltaext_new^0 -> (0 + deltaext^0)}>
<l3, l1, (((1 + c0^0) + wnt^0) <= (~(1) + (2 * deltaext^0))), par{deltaext_new^0 -> (~(1) + deltaext^0)}>
<l3, l1, ((1 + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)), par{deltaext_new^0 -> (1 + deltaext^0)}>
<l4, l3, (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3), par{c0^0 -> 2}>
<l5, l4, true>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (2 = 2) /\ (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3)>
<l3, l3, ((~(1) + (2 * deltaext^0)) <= ((0 + 2) + wnt^0)) /\ (((0 + 2) + wnt^0) <= (0 + (2 * deltaext^0))) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (0 + deltaext^0))}>
<l3, l3, (((1 + 2) + wnt^0) <= (~(1) + (2 * deltaext^0))) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (~(1) + deltaext^0))}>
<l3, l3, ((1 + (2 * deltaext^0)) <= ((0 + 2) + wnt^0)) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (1 + deltaext^0))}>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
<l3, l3, 2*deltaext^0 <= 1 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
Variables:
__disjvr_0^0, deltaext^0, wnt^0

Precedence: 
Graph 0

Graph 1
<l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001573s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019100s
[65003 : 65004]
[65003 : 65005]
Successful child: 65004
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
New Graphs: 
Transitions:
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
Variables:
__disjvr_0^0, deltaext^0, wnt^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002093s
Ranking function: 6 - 12*deltaext^0 + 6*wnt^0
New Graphs: 
Transitions:
<l3, l3, 0 <= wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
Variables:
__disjvr_0^0, deltaext^0, wnt^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000846s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003296s
[65003 : 65014]
[65003 : 65015]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010903s
Time used: 0.010427
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[65003 : 65173]
[65003 : 65174]
Successful child: 65173

Program does NOT terminate