/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, ((arg2 - 5) < arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg2 - 5), arg2 -> undef2}>
<l2, l3, (arg1 < 1) /\ (arg1 < 0) /\ ((arg1 - 1) < arg1) /\ (arg1 < 2), par{arg1 -> (arg1 - 1), arg2 -> undef4}>
<l2, l3, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
<l3, l2, (arg1 < 1) /\ (arg1 < 0) /\ ((arg1 - 1) < arg1) /\ (arg1 < 2), par{arg1 -> (arg1 - 1), arg2 -> undef8}>
<l3, l2, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef10}>
<l4, l1, true, par{arg1 -> undef11, arg2 -> undef12}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = (undef12 - 5)) /\ ((undef12 - 5) < undef12) /\ (undef12 > ~(1)) /\ (undef11 > 0)>
<l2, l2, (arg1 < 1) /\ (arg1 < 0) /\ ((arg1 - 1) < arg1) /\ (arg1 < 2) /\ ((arg1 - 1) < 1) /\ ((arg1 - 1) < 0) /\ (((arg1 - 1) - 1) < (arg1 - 1)) /\ ((arg1 - 1) < 2), par{arg1 -> ((arg1 - 1) - 1)}>
<l2, l2, (arg1 > 1) /\ ((arg1 - 1) < arg1) /\ ((arg1 - 1) > 1) /\ (((arg1 - 1) - 1) < (arg1 - 1)), par{arg1 -> ((arg1 - 1) - 1)}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef11 /\ 0 <= undef12 /\ 5 + arg1 = undef12, {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.008864

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000896s
Ranking function: (~(3) / 2) + (1 / 2)*arg1
New Graphs: 
Transitions:
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000374s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001124s
[37454 : 37455]
[37454 : 37456]
Successful child: 37455
[ 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: 
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 3 <= arg1, {arg1 -> -2 + arg1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 <= arg1 - Process 1
* Exit transition: <l0, l2, 1 <= undef11 /\ 0 <= undef12 /\ 5 + arg1 = undef12, {all remain the same}>
* Postcondition  : 1 <= arg1

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 3 <= arg1, {arg1 -> -2 + arg1, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000410s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001178s
[37454 : 37460]
[37454 : 37461]
Successful child: 37460
[ 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: 
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + arg1 <= 0, {arg1 -> -2 + arg1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:0 <= arg1 - Process 2
* Exit transition: <l0, l2, 1 <= undef11 /\ arg1 <= 0 /\ 0 <= undef12 /\ 5 + arg1 = undef12, {all remain the same}>
* Postcondition  : 0 <= arg1

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000400s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001206s
[37454 : 37465]
[37454 : 37466]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000413s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001220s
[37454 : 37470]
[37454 : 37471]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103073s
Time used: 4.10238

[37454 : 37475]
[37454 : 37479]
Successful child: 37475

Program does NOT terminate