/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/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, (undef8 = undef8), par{__rho_2_^0 -> undef8}>
<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, ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l11, l2, ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l12, l11, ((0 + __rho_2_^0) <= 0)>
<l12, l6, (1 <= (0 + __rho_2_^0))>
<l3, l11, ((1 + __const_5^0) <= (0 + WItemsNum^0))>
<l3, l12, ((0 + WItemsNum^0) <= (0 + __const_5^0))>
<l13, l1, (undef65 = undef65) /\ (undef63 = undef63), par{WItemsNum^0 -> (0 + undef63), __rho_1_^0 -> undef63}>
<l14, l13, true>

Fresh variables:
undef8, undef63, undef65, 

Undef variables:
undef8, undef63, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (WItemsNum^0 = (0 + undef63)) /\ (undef65 = undef65) /\ (undef63 = undef63)>
<l2, l2, (undef8 = undef8) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l2, l2, (undef8 = undef8) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ ((0 + undef8) <= 0) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l2, l6, (undef8 = undef8) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (1 <= (0 + undef8))>
<l6, l6, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l6, l2, ((0 + WItemsNum^0) <= 2), par{WItemsNum^0 -> 1}>

Fresh variables:
undef8, undef63, undef65, 

Undef variables:
undef8, undef63, undef65, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l2, l2, WItemsNum^0 <= __const_5^0 /\ undef8 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l2, l6, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {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, __const_5^0

Precedence: 
Graph 0

Graph 1
<l0, l2, WItemsNum^0 = undef63, {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.010675

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001963s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013001s
[41227 : 41228]
[41227 : 41229]
Successful child: 41228
[ 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, 1 + __const_5^0 <= 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, WItemsNum^0 <= __const_5^0 /\ undef8 <= 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, l6, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {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...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + __const_5^0 <= 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, WItemsNum^0 <= __const_5^0 /\ undef8 <= 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, l6, WItemsNum^0 <= __const_5^0 /\ 1 <= undef8, {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}>
New Graphs: 
Transitions:
<l2, l2, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
Variables:
WItemsNum^0, __const_5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000664s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001802s
[41227 : 41233]
[41227 : 41234]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010619s
Time used: 0.010615

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000452s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001637s
[41227 : 41238]
[41227 : 41239]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009553s
Time used: 0.009549

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000550s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001948s
[41227 : 41243]
[41227 : 41244]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009446s
Time used: 0.009442

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000629s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002279s
[41227 : 41356]
[41227 : 41357]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[41227 : 41361]
[41227 : 41362]
Successful child: 41361

Program does NOT terminate