/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, l5, true>
<l1, l2, ((1 + x^0) <= 0)>
<l1, l3, (0 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}>
<l3, l1, true>
<l4, l1, (((1 + x^0) + y^0) <= 0) /\ (1 <= (0 + x^0))>
<l5, l4, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (((1 + x^0) + y^0) <= 0) /\ (1 <= (0 + x^0))>
<l1, l2, ((1 + x^0) <= 0)>
<l1, l1, (0 <= (0 + x^0)), par{x^0 -> ((0 + x^0) + (~(1) * y^0))}>

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:
<l1, l1, 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

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

Graph 2
<l1, l2, 1 + x^0 <= 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000831s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001400s
[27424 : 27425]
[27424 : 27426]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015651s
Time used: 0.015648

LOG: SAT solveNonLinear - Elapsed time: 0.021944s
Cost: 1; Total time: 0.021661
Termination implied by a set of invariant(s):
Invariant at l1: 1 + y^0 <= 0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, 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): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, rest remain the same}>
Quasi-ranking function: 50000 - x^0 - y^0
New Graphs: 
Transitions:
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000579s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002303s
[27424 : 27430]
[27424 : 27431]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020719s
Time used: 0.020716

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000591s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002261s
[27424 : 27435]
[27424 : 27436]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019413s
Time used: 0.01941

LOG: SAT solveNonLinear - Elapsed time: 0.028111s
Cost: 1; Total time: 0.02769
Termination implied by a set of invariant(s):
Invariant at l1: y^0 <= 1
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y^0 <= 0 /\ 0 <= x^0, {x^0 -> x^0 - y^0, 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): 
<l1, l1, 1 + y^0 <= 0 /\ 50001 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Quasi-ranking function: 50000 - x^0 + y^0
New Graphs: 
Transitions:
<l1, l1, 1 + y^0 <= 0 /\ 50001 <= x^0 /\ 50001 + y^0 <= x^0 /\ 50001 <= x^0 + y^0, {x^0 -> x^0 - y^0, rest remain the same}>
Variables:
x^0, y^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000687s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002791s
[27424 : 27440]
[27424 : 27441]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010283s
Time used: 0.009918
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, 1 + x^0 + y^0 <= 0 /\ 1 <= x^0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[27424 : 27553]
[27424 : 27557]
Successful child: 27553

Program does NOT terminate