/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, l3, true>
<l1, l2, (1 > (~(1) * arg2)) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (~(1) * arg2), arg2 -> undef2}>
<l2, l2, (arg1 < 3) /\ (arg1 < 1) /\ ((arg1 - 2) < arg1) /\ (arg1 < 0), par{arg1 -> (arg1 - 2), arg2 -> undef4}>
<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>

Fresh variables:
undef2, undef4, undef5, undef6, 

Undef variables:
undef2, undef4, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = (~(1) * undef6)) /\ (1 > (~(1) * undef6)) /\ (undef6 > ~(1)) /\ (undef5 > 0)>
<l2, l2, (arg1 < 3) /\ (arg1 < 1) /\ ((arg1 - 2) < arg1) /\ (arg1 < 0), par{arg1 -> (arg1 - 2)}>

Fresh variables:
undef2, undef4, undef5, undef6, 

Undef variables:
undef2, undef4, undef5, undef6, 

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}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef5 /\ 0 <= undef6 /\ arg1 + undef6 = 0, {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.001986

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000432s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001129s
[37761 : 37762]
[37761 : 37763]
Successful child: 37762
[ 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...

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}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000476s
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.000406s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001196s
[37761 : 37767]
[37761 : 37768]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012442s
Time used: 0.01244

LOG: SAT solveNonLinear - Elapsed time: 0.018012s
Cost: 1; Total time: 0.017712
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.000386s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001184s
[37761 : 37796]
[37761 : 37797]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004862s
Time used: 0.004608

[37761 : 37801]
[37761 : 37805]
Successful child: 37801

Program does NOT terminate