/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (1 <= (0 + x^0)) /\ (undef4 = ((0 + i^0) + y^0)), par{i^0 -> (1 + i^0), x^0 -> ((0 + x^0) + (~(1) * undef4)), z^0 -> undef4}>
<l2, l1, true>
<l3, l1, (undef11 = undef11), par{i^0 -> 0, y^0 -> undef11}>
<l4, l3, true>

Fresh variables:
undef4, undef11, 

Undef variables:
undef4, undef11, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef4, undef11, 

Undef variables:
undef4, undef11, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
Variables:
i^0, x^0, y^0

Precedence: 
Graph 0

Graph 1
<l0, l1, i^0 = 0 /\ y^0 = undef11, {all 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.002396

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000958s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002600s
[45433 : 45434]
[45433 : 45435]
Successful child: 45434
[ 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 <= i^0 + y^0 /\ 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, 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 <= i^0 + y^0 /\ 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>
Ranking function: 2 + i^0 + 2*x^0 + y^0
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000599s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= i^0 + y^0 , 
Narrowing transition: 
<l1, l1, 1 <= x^0 /\ i^0 + y^0 = undef4, {i^0 -> 1 + i^0, x^0 -> x^0 - undef4, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000928s
Ranking function: -i^0 - y^0
New Graphs: 
Program Terminates