/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, l7, true>
<l1, l2, true>
<l3, l4, true>
<l4, l3, (undef9 = undef9), par{j^0 -> (~(1) + j^0), temp^0 -> undef9}>
<l4, l1, true, par{i^0 -> (1 + i^0)}>
<l2, l5, (11 <= (0 + i^0))>
<l2, l3, ((0 + i^0) <= 10), par{j^0 -> (0 + i^0)}>
<l6, l1, true, par{i^0 -> 2}>
<l7, l6, true>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (i^0 = 2) /\ ((0 + 2) <= 10), par{j^0 -> (0 + 2)}>
<l3, l3, (undef9 = undef9), par{j^0 -> (~(1) + j^0)}>
<l3, l5, (11 <= (0 + (1 + i^0))), par{i^0 -> (1 + i^0)}>
<l3, l3, ((0 + (1 + i^0)) <= 10), par{i^0 -> (1 + i^0), j^0 -> (0 + (1 + i^0))}>

Fresh variables:
undef9, 

Undef variables:
undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, i^0 = 2, {j^0 -> 2, rest remain the same}>

Graph 2
<l3, l5, 10 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000965s
Ranking function: 9 - i^0
New Graphs: 
Transitions:
<l3, l3, true, {j^0 -> -1 + j^0, rest remain the same}>
Variables:
j^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000426s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000864s
[54191 : 54192]
[54191 : 54193]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021020s
Time used: 0.021017

LOG: SAT solveNonLinear - Elapsed time: 0.030308s
Cost: 1; Total time: 0.030029
Termination implied by a set of invariant(s):
Invariant at l3: 1 <= i^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 <= i^0, {j^0 -> -1 + j^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000470s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001606s
[54191 : 54197]
[54191 : 54198]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.217003s
Time used: 4.2168
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, i^0 = 2, {j^0 -> 2, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, i^0 = 2, {j^0 -> 2, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[54191 : 54202]
[54191 : 54203]
Successful child: 54202

Program does NOT terminate