/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, l6, true>
<l1, l2, true, par{r^0 -> (0 + p^0)}>
<l1, l2, true, par{q^0 -> (0 + p^0)}>
<l3, l4, ((0 + q^0) <= (1 + r^0))>
<l3, l1, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{p^0 -> undef14}>
<l2, l3, true>
<l5, l2, true, par{q^0 -> (0 + N^0), r^0 -> 1}>
<l6, l5, true>

Fresh variables:
undef14, 

Undef variables:
undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (q^0 = (0 + N^0)) /\ (r^0 = 1)>
<l2, l4, ((0 + q^0) <= (1 + r^0))>
<l2, l2, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{r^0 -> (0 + undef14)}>
<l2, l2, ((2 + r^0) <= (0 + q^0)) /\ (undef14 = undef14), par{q^0 -> (0 + undef14)}>

Fresh variables:
undef14, 

Undef variables:
undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Variables:
q^0, r^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, N^0 = q^0 /\ r^0 = 1, {all remain the same}>

Graph 2
<l2, l4, q^0 <= 1 + r^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000935s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003248s
[1263 : 1264]
[1263 : 1265]
Successful child: 1264
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, 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, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, 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, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000588s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: q^0 <= 1 + r^0 , 
Narrowing transition: 
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 2 + r^0 <= q^0, {r^0 -> undef14, rest remain the same}>
<l2, l2, 2 + r^0 <= q^0, {q^0 -> undef14, rest remain the same}>
Variables:
q^0, r^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000902s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003441s
[1263 : 1269]
[1263 : 1270]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013435s
Time used: 0.013027

[1263 : 1274]
[1263 : 1278]
Successful child: 1278

Program does NOT terminate