/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, l3, true>
<l1, l2, (arg1 > 0) /\ (arg2 > 4), par{arg1 -> arg2, arg2 -> undef2}>
<l1, l2, (1 > (~(1) * arg2)) /\ (arg2 > ~(1)) /\ (arg2 < 5) /\ (arg1 > 0), par{arg1 -> (~(1) * arg2), arg2 -> undef4}>
<l2, l2, (arg1 < 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
<l2, l2, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef8}>
<l3, 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, (undef9 > 0) /\ (undef10 > 4), par{arg1 -> undef10}>
<l0, l2, (1 > (~(1) * undef10)) /\ (undef10 > ~(1)) /\ (undef10 < 5) /\ (undef9 > 0), par{arg1 -> (~(1) * undef10)}>
<l2, l2, (arg1 < 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1)}>
<l2, l2, (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, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef9 /\ 5 <= undef10, {arg1 -> undef10, rest remain the same}>
<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ undef10 <= 4, {arg1 -> -undef10, rest 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.002887

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000791s
Ranking function: -1 + arg1
New Graphs: 
Transitions:
<l2, l2, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000364s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001105s
[54353 : 54354]
[54353 : 54355]
Successful child: 54354
[ 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 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL check - Post:0 <= arg1 - Process 1
* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ undef10 <= 4, {arg1 -> -undef10, rest remain the same}>
* Postcondition  : 0 <= arg1

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000412s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001184s
[54353 : 54359]
[54353 : 54360]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.010282s
Time used: 1.01015

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000408s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001186s
[54353 : 54364]
[54353 : 54365]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102332s
Time used: 4.10151

[54353 : 54369]
[54353 : 54373]
Successful child: 54369

Program does NOT terminate