/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, l32, true>
<l1, l2, ((0 + r0^0) <= 0) /\ (0 <= (0 + r0^0))>
<l3, l4, ((0 + r^0) <= 1) /\ (1 <= (0 + r^0))>
<l5, l4, ((0 + r^0) <= 1) /\ (1 <= (0 + r^0))>
<l6, l4, ((0 + r^0) <= 1) /\ (1 <= (0 + r^0))>
<l7, l8, true, par{x1^0 -> (0 + x^0)}>
<l7, l9, true>
<l9, l7, true>
<l7, l4, true>
<l8, l10, ((1 + x1^0) <= 2)>
<l8, l10, (3 <= (0 + x1^0))>
<l10, l3, true, par{r^0 -> 0}>
<l8, l3, true, par{r^0 -> 1}>
<l8, l11, true>
<l11, l8, true>
<l12, l13, ((1 + x1^0) <= 2)>
<l12, l13, (3 <= (0 + x1^0))>
<l13, l5, true, par{r^0 -> 0}>
<l12, l5, true, par{r^0 -> 1}>
<l12, l14, true>
<l14, l12, true>
<l15, l16, ((1 + x1^0) <= 2)>
<l15, l16, (3 <= (0 + x1^0))>
<l16, l6, true, par{r^0 -> 0}>
<l15, l6, true, par{r^0 -> 1}>
<l15, l17, true>
<l17, l15, true>
<l18, l19, ((1 + x1^0) <= 2)>
<l18, l19, (3 <= (0 + x1^0))>
<l19, l3, true, par{r^0 -> 0}>
<l18, l3, true, par{r^0 -> 1}>
<l18, l8, true, par{x^0 -> 2}>
<l20, l21, ((1 + x1^0) <= 2)>
<l20, l21, (3 <= (0 + x1^0))>
<l21, l5, true, par{r^0 -> 0}>
<l20, l5, true, par{r^0 -> 1}>
<l20, l12, true, par{x^0 -> 2}>
<l22, l23, ((1 + x1^0) <= 2)>
<l22, l23, (3 <= (0 + x1^0))>
<l23, l6, true, par{r^0 -> 0}>
<l22, l6, true, par{r^0 -> 1}>
<l22, l15, true, par{x^0 -> 2}>
<l24, l25, ((1 + x1^0) <= 2)>
<l24, l25, (3 <= (0 + x1^0))>
<l25, l3, true, par{r^0 -> 0}>
<l24, l3, true, par{r^0 -> 1}>
<l24, l18, true, par{x^0 -> 1}>
<l26, l27, ((1 + x1^0) <= 2)>
<l26, l27, (3 <= (0 + x1^0))>
<l27, l5, true, par{r^0 -> 0}>
<l26, l5, true, par{r^0 -> 1}>
<l26, l20, true, par{x^0 -> 1}>
<l28, l29, ((1 + x1^0) <= 2)>
<l28, l29, (3 <= (0 + x1^0))>
<l29, l6, true, par{r^0 -> 0}>
<l28, l6, true, par{r^0 -> 1}>
<l28, l22, true, par{x^0 -> 1}>
<l30, l20, true, par{x1^0 -> (0 + x^0)}>
<l30, l7, true, par{x^0 -> 2}>
<l30, l4, true>
<l31, l28, true, par{x1^0 -> (0 + x^0)}>
<l31, l30, true, par{x^0 -> 1}>
<l31, l4, true>
<l32, l31, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{x1^0 -> (0 + x^0)}>
<l0, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{x1^0 -> (0 + x^0), x^0 -> 1}>
<l0, l15, true, par{x1^0 -> (0 + x^0), x^0 -> 2}>
<l0, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1)), par{x1^0 -> (0 + 1), x^0 -> 1}>
<l0, l12, true, par{x1^0 -> (0 + 1), x^0 -> 2}>
<l0, l7, true, par{x^0 -> 2}>
<l0, l4, true, par{x^0 -> 1}>
<l0, l4, true>
<l7, l8, true, par{x1^0 -> (0 + x^0)}>
<l7, l7, true>
<l7, l4, true>
<l8, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1))>
<l8, l8, true>
<l12, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1))>
<l12, l12, true>
<l15, l4, ((0 + 1) <= 1) /\ (1 <= (0 + 1))>
<l15, l15, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
<l8, l8, true, {all remain the same}>
Variables:

Graph 3:
Transitions:
<l12, l12, true, {all remain the same}>
Variables:

Graph 4:
Transitions:
<l15, l15, true, {all remain the same}>
Variables:

Graph 5:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, true, {x^0 -> 2, rest remain the same}>

Graph 2
<l7, l8, true, {x1^0 -> x^0, rest remain the same}>

Graph 3
<l0, l12, true, {x1^0 -> 1, x^0 -> 2, rest remain the same}>

Graph 4
<l0, l15, true, {x1^0 -> x^0, x^0 -> 2, rest remain the same}>

Graph 5
<l0, l4, true, {x1^0 -> x^0, rest remain the same}>
<l0, l4, true, {x1^0 -> x^0, x^0 -> 1, rest remain the same}>
<l0, l4, true, {x1^0 -> 1, x^0 -> 1, rest remain the same}>
<l0, l4, true, {x^0 -> 1, rest remain the same}>
<l0, l4, true, {all remain the same}>
<l7, l4, true, {all remain the same}>
<l8, l4, true, {all remain the same}>
<l12, l4, true, {all remain the same}>
<l15, l4, true, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 4 , 5 )
( 7 , 1 )
( 8 , 2 )
( 12 , 3 )
( 15 , 4 )

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l7, true, {x^0 -> 2, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, true, {x^0 -> 2, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[34663 : 34664]
[34663 : 34665]
Successful child: 34664

Program does NOT terminate