/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, l4, true>
<l1, l2, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)), par{x^0 -> undef5}>
<l2, l1, (undef10 = ((0 + __const_400^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
<l3, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
<l3, l2, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)), par{x^0 -> undef20}>
<l4, l3, true>

Fresh variables:
undef5, undef10, undef15, undef20, 

Undef variables:
undef5, undef10, undef15, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
<l0, l1, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)) /\ (undef10 = ((0 + __const_400^0) + undef20)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
<l1, l1, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)) /\ (undef10 = ((0 + __const_400^0) + undef5)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>

Fresh variables:
undef5, undef10, undef15, undef20, 

Undef variables:
undef5, undef10, undef15, undef20, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
<l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000841s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003329s
[58915 : 58916]
[58915 : 58917]
Successful child: 58916
[ 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: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
New Graphs: 
[58915 : 58921]
[58915 : 58922]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: __const_300^0 + x^0 <= __const_100^0 , 
Narrowing transition: 
<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000908s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003830s
[58915 : 58923]
[58915 : 58924]
Successful child: 58923
[ 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 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, 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 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Ranking function: -__const_100^0 + __const_300^0 + x^0
New Graphs: 
[58915 : 58928]
[58915 : 58929]
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + __const_300^0 + __const_400^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
Variables:
__const_100^0, __const_300^0, __const_400^0, x^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000981s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004088s
[58915 : 58930]
[58915 : 58931]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010860s
Time used: 0.010244

[58915 : 58953]
[58915 : 58954]
Successful child: 58953

Program does NOT terminate