/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, l11, true>
<l1, l2, ((0 + tmp1^0) <= 0) /\ (0 <= (0 + tmp1^0)), par{Stored^0 -> 1}>
<l1, l3, (1 <= (0 + tmp1^0))>
<l1, l3, ((1 + tmp1^0) <= 0)>
<l4, l1, (undef11 = undef11), par{tmp1^0 -> undef11}>
<l5, l2, ((0 + tmp___02^0) <= 0) /\ (0 <= (0 + tmp___02^0))>
<l5, l4, (1 <= (0 + tmp___02^0))>
<l5, l4, ((1 + tmp___02^0) <= 0)>
<l6, l7, true>
<l8, l5, (undef27 = undef27), par{tmp___02^0 -> undef27}>
<l2, l9, true>
<l9, l6, (2 <= (0 + Stored^0))>
<l9, l6, ((1 + Stored^0) <= 1)>
<l9, l6, ((0 + Stored^0) <= 1) /\ (1 <= (0 + Stored^0)), par{Stored^0 -> 0}>
<l3, l8, true>
<l10, l8, true, par{Stored^0 -> 0}>
<l11, l10, true>

Fresh variables:
undef11, undef27, 

Undef variables:
undef11, undef27, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l8, (Stored^0 = 0)>
<l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ (2 <= (0 + Stored^0))>
<l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ ((1 + Stored^0) <= 1)>
<l8, l7, (undef27 = undef27) /\ ((0 + undef27) <= 0) /\ (0 <= (0 + undef27)) /\ ((0 + Stored^0) <= 1) /\ (1 <= (0 + Stored^0)), par{Stored^0 -> 0}>
<l8, l7, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)) /\ ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{Stored^0 -> 0}>
<l8, l8, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ (1 <= (0 + undef11))>
<l8, l8, (undef27 = undef27) /\ (1 <= (0 + undef27)) /\ (undef11 = undef11) /\ ((1 + undef11) <= 0)>
<l8, l7, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ ((0 + undef11) <= 0) /\ (0 <= (0 + undef11)) /\ ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{Stored^0 -> 0}>
<l8, l8, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ (1 <= (0 + undef11))>
<l8, l8, (undef27 = undef27) /\ ((1 + undef27) <= 0) /\ (undef11 = undef11) /\ ((1 + undef11) <= 0)>

Fresh variables:
undef11, undef27, 

Undef variables:
undef11, undef27, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l8, l8, 1 <= undef11 /\ 1 <= undef27, {all remain the same}>
<l8, l8, 1 + undef11 <= 0 /\ 1 <= undef27, {all remain the same}>
<l8, l8, 1 <= undef11 /\ 1 + undef27 <= 0, {all remain the same}>
<l8, l8, 1 + undef11 <= 0 /\ 1 + undef27 <= 0, {all remain the same}>
Variables:

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l8, Stored^0 = 0, {all remain the same}>

Graph 2
<l8, l7, 2 <= Stored^0 /\ undef27 = 0, {all remain the same}>
<l8, l7, Stored^0 <= 0 /\ undef27 = 0, {all remain the same}>
<l8, l7, undef27 = 0 /\ Stored^0 = 1, {Stored^0 -> 0, rest remain the same}>
<l8, l7, 1 <= undef27 /\ undef11 = 0, {Stored^0 -> 0, rest remain the same}>
<l8, l7, 1 + undef27 <= 0 /\ undef11 = 0, {Stored^0 -> 0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 7 , 2 )
( 8 , 1 )

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

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

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

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

LOG: CALL solveLinear

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

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

[63048 : 63049]
[63048 : 63050]
Successful child: 63049

Program does NOT terminate