/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, l18, true>
<l1, l2, true>
<l2, l1, true>
<l3, l4, true>
<l4, l5, (undef16 = undef16), par{__rho_2_^0 -> undef16}>
<l6, l7, true>
<l8, l9, true>
<l10, l11, true>
<l11, l10, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l11, l3, ((0 + WItemsNum^0) <= 2)>
<l9, l12, true>
<l12, l9, true>
<l13, l4, ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l13, l4, ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l14, l13, ((0 + __rho_2_^0) <= 0)>
<l14, l10, (1 <= (0 + __rho_2_^0))>
<l5, l13, ((1 + __const_5^0) <= (0 + WItemsNum^0))>
<l5, l14, ((0 + WItemsNum^0) <= (0 + __const_5^0))>
<l15, l3, true>
<l16, l3, (0 <= (0 + WItemsNum^0))>
<l16, l1, ((1 + WItemsNum^0) <= 0)>
<l17, l16, (undef85 = undef85) /\ (undef83 = undef83), par{WItemsNum^0 -> (0 + undef83), __rho_1_^0 -> undef83}>
<l18, l17, true>

Fresh variables:
undef16, undef83, undef85, 

Undef variables:
undef16, undef83, undef85, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (WItemsNum^0 = (0 + undef83)) /\ (undef85 = undef85) /\ (undef83 = undef83) /\ (0 <= (0 + (0 + undef83)))>
<l0, l1, (WItemsNum^0 = (0 + undef83)) /\ (undef85 = undef85) /\ (undef83 = undef83) /\ ((1 + (0 + undef83)) <= 0)>
<l1, l1, true>
<l4, l4, (undef16 = undef16) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)) /\ ((1 + __const_5^0) <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l4, l4, (undef16 = undef16) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ ((0 + undef16) <= 0) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)), par{WItemsNum^0 -> (1 + WItemsNum^0)}>
<l4, l10, (undef16 = undef16) /\ ((0 + WItemsNum^0) <= (0 + __const_5^0)) /\ (1 <= (0 + undef16))>
<l10, l10, (3 <= (0 + WItemsNum^0)), par{WItemsNum^0 -> (~(1) + WItemsNum^0)}>
<l10, l4, ((0 + WItemsNum^0) <= 2)>

Fresh variables:
undef16, undef83, undef85, 

Undef variables:
undef16, undef83, undef85, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, true, {all remain the same}>
Variables:

Graph 2:
Transitions:
<l4, l4, 1 + __const_5^0 <= WItemsNum^0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l4, l4, WItemsNum^0 <= __const_5^0 /\ undef16 <= 0, {WItemsNum^0 -> 1 + WItemsNum^0, rest remain the same}>
<l4, l10, WItemsNum^0 <= __const_5^0 /\ 1 <= undef16, {all remain the same}>
<l10, l10, 3 <= WItemsNum^0, {WItemsNum^0 -> -1 + WItemsNum^0, rest remain the same}>
<l10, l4, WItemsNum^0 <= 2, {all remain the same}>
Variables:
WItemsNum^0, __const_5^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 + undef83 <= 0 /\ WItemsNum^0 = undef83, {all remain the same}>

Graph 2
<l0, l4, 0 <= undef83 /\ WItemsNum^0 = undef83, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )
( 4 , 2 )
( 10 , 2 )

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 1 + undef83 <= 0 /\ WItemsNum^0 = undef83, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, 1 + undef83 <= 0 /\ WItemsNum^0 = undef83, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[38989 : 38990]
[38989 : 38991]
Successful child: 38990

Program does NOT terminate