/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, true, par{arg1 -> ~(1)}>
<l2, l2, (arg1 < 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1)}>
<l2, l2, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1)}>
<l3, l1, true, par{arg1 -> undef4}>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef4, 

Undef variables:
undef4, 

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 + arg1 = 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.002888
Some transition disabled by a set of invariant(s):
Invariant at l2: 1 + arg1 <= 0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1, {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 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
Checking unfeasibility...
Time used: 0.00145

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000416s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001097s
[36372 : 36373]
[36372 : 36374]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000241s
Time used: 1.00026

LOG: SAT solveNonLinear - Elapsed time: 1.005143s
Cost: 1; Total time: 1.00488
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.000418s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001179s
[36372 : 36378]
[36372 : 36379]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.114179s
Time used: 4.11385
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, 1 + arg1 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[36372 : 36383]
[36372 : 36384]
Successful child: 36383

Program does NOT terminate