/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, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l3, (arg1 < 10), par{arg2 -> undef4}>
<l2, l2, (0 = arg1), par{arg1 -> 1, arg2 -> undef6}>
<l3, l3, (arg1 > 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef8}>
<l4, l1, true, par{arg1 -> undef9, arg2 -> undef10}>

Fresh variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Undef variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
<l2, l3, (arg1 < 10)>
<l2, l2, (0 = arg1), par{arg1 -> 1}>
<l3, l3, (arg1 > 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}>

Fresh variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Undef variables:
undef2, undef4, undef6, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
Variables:
arg1

Graph 2:
Transitions:
<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>

Graph 2
<l2, l3, arg1 <= 9, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000471s
Ranking function: -arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.001237

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000536s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001273s
[29392 : 29393]
[29392 : 29394]
Successful child: 29393
[ 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: 
<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:arg1 <= 0 - Process 1
* Exit transition: <l2, l3, arg1 <= 9, {all remain the same}>
* Postcondition  : arg1 <= 0
Quasi-invariants: 
Location 2: arg1 <= 0 ; 1 <= 0 ; 
[29392 : 29398]
[29392 : 29399]

LOG: NarrowEntry size 2
Narrowing transition: 
<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>

LOG: Narrow transition size 2
ENTRIES:
<l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
END GRAPH:
EXIT: <l2, l3, arg1 <= 9, {all remain the same}>
POST: arg1 <= 0


LOG: Try proving POST
[29392 : 29400]
[29392 : 29401]
[29392 : 29402]
Successful child: 29400
[29392 : 29403]
[29392 : 29404]

LOG: NarrowEntry size 1

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 10 <= arg1 , 
Narrowing transition: 
<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 0 <= 0 /\ arg1 <= 0 /\ 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
<l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 <= 9 /\ arg1 = undef10, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 0 <= 0 /\ arg1 = 0, {arg1 -> 1, rest remain the same}>
END GRAPH:
EXIT: <l2, l3, arg1 <= 9, {all remain the same}>
POST: arg1 <= 0


LOG: Try proving POST
[29392 : 29405]
[29392 : 29406]
[29392 : 29407]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 1.060002s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: arg1 <= 0 , 
Narrowing transition: 
<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000573s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001387s
[29392 : 29408]
[29392 : 29409]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000542s
Time used: 1.00044

LOG: SAT solveNonLinear - Elapsed time: 1.005965s
Cost: 1; Total time: 1.00559
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= 1 + arg1
[ 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 <= arg1, {arg1 -> 1 + arg1, 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 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Quasi-ranking function: 50000 - arg1
New Graphs: 
Transitions:
<l3, l3, 50001 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000414s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001205s
[29392 : 29517]
[29392 : 29518]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102189s
Time used: 4.10127

[29392 : 29522]
[29392 : 29525]
Successful child: 29522

Program does NOT terminate