/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, l10, true>
<l1, l2, true, par{i^0 -> (1 + i^0)}>
<l3, l1, true>
<l3, l1, true>
<l3, l4, true>
<l2, l3, true>
<l5, l6, true>
<l7, l5, true>
<l7, l5, true>
<l7, l6, true>
<l8, l5, ((0 + i^0) <= (0 + k^0))>
<l8, l7, ((1 + k^0) <= (0 + i^0))>
<l4, l5, ((1 + k^0) <= 0)>
<l4, l8, (0 <= (0 + k^0))>
<l9, l2, (undef28 = undef28), par{i^0 -> 0, k^0 -> undef28}>
<l10, l9, true>

Fresh variables:
undef28, 

Undef variables:
undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (i^0 = 0) /\ (k^0 = undef28) /\ (undef28 = undef28)>
<l2, l2, true, par{i^0 -> (1 + i^0)}>
<l2, l2, true, par{i^0 -> (1 + i^0)}>
<l2, l6, ((1 + k^0) <= 0)>
<l2, l6, (0 <= (0 + k^0)) /\ ((0 + i^0) <= (0 + k^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>
<l2, l6, (0 <= (0 + k^0)) /\ ((1 + k^0) <= (0 + i^0))>

Fresh variables:
undef28, 

Undef variables:
undef28, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
<l2, l2, true, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>

Graph 2
<l2, l6, 1 + k^0 <= 0, {all remain the same}>
<l2, l6, i^0 <= k^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>
<l2, l6, 1 + k^0 <= i^0 /\ 0 <= k^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000564s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001107s
[39513 : 39514]
[39513 : 39515]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000485s
Time used: 1.00038

LOG: SAT solveNonLinear - Elapsed time: 1.009449s
Cost: 1; Total time: 1.00907
Quasi-ranking function: 50000 - i^0
New Graphs: 
Transitions:
<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
<l2, l2, 50001 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
Variables:
i^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000627s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003045s
[39513 : 39519]
[39513 : 39520]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101594s
Time used: 4.10071
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, i^0 = 0 /\ k^0 = undef28, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[39513 : 39524]
[39513 : 39525]
Successful child: 39524

Program does NOT terminate