/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, l14, true>
<l1, l2, true>
<l2, l3, (undef6 = undef6), par{___rho_2_^0 -> undef6}>
<l4, l5, true>
<l6, l7, true>
<l8, l9, true>
<l7, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l7, l1, ((0 + WItemsNum^0) <= 2), par{WItemsNum^0 -> 1}>
<l9, l10, true>
<l10, l9, true>
<l11, l2, (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l11, l2, ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l12, l11, ((0 + ___rho_2_^0) <= 0)>
<l12, l6, (1 <= (0 + ___rho_2_^0))>
<l3, l11, (6 <= (0 + WItemsNum^0))>
<l3, l12, ((0 + WItemsNum^0) <= 5)>
<l13, l1, (undef49 = undef49) /\ (undef47 = undef47), par{WItemsNum^0 -> (0 + undef47), ___rho_1_^0 -> undef47}>
<l14, l13, true>

Fresh variables:
undef6, undef47, undef49, 

Undef variables:
undef6, undef47, undef49, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (WItemsNum^0 = (0 + undef47)) /\ (undef49 = undef49) /\ (undef47 = undef47)>
<l2, l2, (undef6 = undef6) /\ (6 <= (0 + WItemsNum^0)) /\ (6 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l2, l2, (undef6 = undef6) /\ ((0 + WItemsNum^0) <= 5) /\ ((0 + undef6) <= 0) /\ ((0 + WItemsNum^0) <= 5), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l2, l6, (undef6 = undef6) /\ ((0 + WItemsNum^0) <= 5) /\ (1 <= (0 + undef6))>
<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l6, l2, ((0 + WItemsNum^0) <= 2), par{WItemsNum^0 -> 1}>

Fresh variables:
undef6, undef47, undef49, 

Undef variables:
undef6, undef47, undef49, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 6 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l2, l2, undef6 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l2, l6, 1 <= undef6 /\ WItemsNum^0 <= 5, {all remain the same}>
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
<l6, l2, WItemsNum^0 <= 2, {WItemsNum^0 -> 1, rest remain the same}>
Variables:
WItemsNum^0

Precedence: 
Graph 0

Graph 1
<l0, l2, WItemsNum^0 = undef47, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2, l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001339s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014931s
[29997 : 29998]
[29997 : 29999]
Successful child: 29998
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, 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, undef6 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l6, 1 <= undef6 /\ WItemsNum^0 <= 5, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l2, WItemsNum^0 <= 2, {WItemsNum^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l6, l6, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 6 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, 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, undef6 <= 0 /\ WItemsNum^0 <= 5, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l6, 1 <= undef6 /\ WItemsNum^0 <= 5, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l6, l2, WItemsNum^0 <= 2, {WItemsNum^0 -> 1, rest remain the same}>
New Graphs: 
Transitions:
<l2, l2, 6 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000424s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001221s
[29997 : 30003]
[29997 : 30004]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009616s
Time used: 0.009612

LOG: SAT solveNonLinear - Elapsed time: 0.014437s
Cost: 1; Total time: 0.014113
Quasi-ranking function: 50000 - WItemsNum^0
New Graphs: 
Transitions:
<l2, l2, 50001 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000399s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001163s
[29997 : 30159]
[29997 : 30160]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004006s
Time used: 0.003718
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, WItemsNum^0 = undef47, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[29997 : 30180]
[29997 : 30181]
Successful child: 30180

Program does NOT terminate