/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, l8, true>
<l1, l2, true, par{p_14^0 -> (0 + x_13^0)}>
<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef10 = undef10), par{lt_15^0 -> undef10, rt_11^0 -> (0 + st_17^0)}>
<l2, l4, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef19 = undef19) /\ (undef28 = undef28) /\ (undef24 = (0 + undef28)) /\ (undef21 = undef21) /\ (0 <= (0 + undef24)) /\ ((0 + undef24) <= 0), par{lt_15^0 -> undef19, nd_12^0 -> undef21, rv_18^0 -> undef24}>
<l4, l2, true>
<l2, l5, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef38 = undef38) /\ (undef47 = undef47) /\ (undef40 = undef40), par{lt_15^0 -> undef38, nd_12^0 -> undef40, rv_18^0 -> (0 + undef47)}>
<l5, l6, (1 <= (0 + rv_18^0))>
<l5, l6, ((1 + rv_18^0) <= 0)>
<l6, l7, (undef67 = undef67), par{lt_19^0 -> undef67}>
<l7, l2, true>
<l8, l1, true>

Fresh variables:
undef10, undef19, undef21, undef24, undef28, undef38, undef40, undef47, undef67, 

Undef variables:
undef10, undef19, undef21, undef24, undef28, undef38, undef40, undef47, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, ((0 + y_16^0) <= (0 + lt_15^0)) /\ (undef10 = undef10), par{lt_15^0 -> undef10}>
<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef19 = undef19) /\ (undef28 = undef28) /\ (undef24 = (0 + undef28)) /\ (undef21 = undef21) /\ (0 <= (0 + undef24)) /\ ((0 + undef24) <= 0), par{lt_15^0 -> undef19}>
<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef38 = undef38) /\ (undef47 = undef47) /\ (undef40 = undef40) /\ (1 <= (0 + (0 + undef47))) /\ (undef67 = undef67), par{lt_15^0 -> undef38}>
<l2, l2, ((1 + lt_15^0) <= (0 + y_16^0)) /\ (undef38 = undef38) /\ (undef47 = undef47) /\ (undef40 = undef40) /\ ((1 + (0 + undef47)) <= 0) /\ (undef67 = undef67), par{lt_15^0 -> undef38}>

Fresh variables:
undef10, undef19, undef21, undef24, undef28, undef38, undef40, undef47, undef67, 

Undef variables:
undef10, undef19, undef21, undef24, undef28, undef38, undef40, undef47, undef67, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>
Variables:
lt_15^0, y_16^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, y_16^0 <= lt_15^0, {lt_15^0 -> undef10, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001356s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006780s
[1755 : 1756]
[1755 : 1757]
Successful child: 1756
[ 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, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, 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, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, 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, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + y_16^0 <= lt_15^0 - Process 1
* Exit transition: <l0, l2, true, {all remain the same}>
* Postcondition  : 1 + y_16^0 <= lt_15^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000490s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 1 + y_16^0 <= lt_15^0 , 
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>
Variables:
lt_15^0, y_16^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001315s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006747s
[1755 : 1761]
[1755 : 1762]
Successful child: 1761
[ 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, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, 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, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, 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, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, 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, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:y_16^0 <= lt_15^0 - Process 2
* Exit transition: <l0, l2, lt_15^0 <= y_16^0, {all remain the same}>
* Postcondition  : y_16^0 <= lt_15^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000594s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: y_16^0 <= lt_15^0 , 
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ undef24 = 0 /\ undef24 = undef28, {lt_15^0 -> undef19, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 <= undef47, {lt_15^0 -> undef38, rest remain the same}>
<l2, l2, 1 + lt_15^0 <= y_16^0 /\ 1 + undef47 <= 0, {lt_15^0 -> undef38, rest remain the same}>
Variables:
lt_15^0, y_16^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001301s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006714s
[1755 : 1766]
[1755 : 1767]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019135s
Time used: 0.018231

[1755 : 1771]
[1755 : 1774]
Successful child: 1774

Program does NOT terminate