/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, true, par{arg1 -> 3}>
<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 3)}>
<l2, l2, (arg1 < 11) /\ (arg1 < 6) /\ (arg1 > 2), 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 = 3)>
<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 3)}>
<l2, l2, (arg1 < 11) /\ (arg1 < 6) /\ (arg1 > 2), 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, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
<l2, l2, 3 <= arg1 /\ arg1 <= 5, {arg1 -> 1 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 3, {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.254154

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000370s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001140s
[20977 : 20978]
[20977 : 20979]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000469s
Time used: 1.00043

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000420s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001191s
[20977 : 20983]
[20977 : 20984]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

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

LOG: CALL solveLinear

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

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

[20977 : 21096]
[20977 : 21100]
Successful child: 21096

Program does NOT terminate