/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, l5, true>
<l1, l2, true, par{x_1^0 -> 1, y_1^0 -> 1}>
<l2, l3, true, par{x_1^0 -> (1 + x_1^0)}>
<l3, l2, true>
<l2, l4, (2 <= 0)>
<l5, l1, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (x_1^0 = 1)>
<l2, l2, true, par{x_1^0 -> (1 + x_1^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:
<l2, l2, true, {x_1^0 -> 1 + x_1^0, rest remain the same}>
Variables:
x_1^0

Precedence: 
Graph 0

Graph 1
<l0, l2, x_1^0 = 1, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000463s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000838s
[36263 : 36264]
[36263 : 36265]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000472s
Time used: 1.00035

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000394s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001175s
[36263 : 36269]
[36263 : 36270]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102319s
Time used: 4.10154
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, x_1^0 = 1, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[36263 : 36382]
[36263 : 36383]
Successful child: 36382

Program does NOT terminate