/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 > ~(1)), par{arg1 -> 0, arg2 -> 0, arg3 -> arg2}>
<l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
<l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}>
<l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg2 -> 0, arg3 -> 9}>
<l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>
<l3, l1, true, par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30}>

Fresh variables:
undef28, undef29, undef30, 

Undef variables:
undef28, undef29, undef30, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = undef29) /\ (undef28 > 0) /\ (undef29 > ~(1))>
<l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg1 -> 0, arg2 -> 0, arg3 -> 9}>
<l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg1 -> 1, arg2 -> 1, arg3 -> 1}>
<l2, l2, (arg3 < 10) /\ (arg3 < 11) /\ (arg1 < 2) /\ (arg3 > 0) /\ (0 = arg2), par{arg2 -> 0, arg3 -> (arg3 - 1)}>
<l2, l2, (arg1 < 2) /\ (10 = arg3), par{arg2 -> 0, arg3 -> 9}>
<l2, l2, (arg3 < 11) /\ (arg3 > 0) /\ (arg3 < 10) /\ (arg1 < 2) /\ (1 = arg2), par{arg2 -> 1, arg3 -> (arg3 + 1)}>
<l2, l2, (arg1 < 2) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}>

Fresh variables:
undef28, undef29, undef30, 

Undef variables:
undef28, undef29, undef30, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg1 -> 0, arg2 -> 0, arg3 -> 9, rest remain the same}>
<l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 1, {arg1 -> 1, arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> 1, rest remain the same}>
<l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 0, {arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 10, {arg2 -> 0, arg3 -> 9, rest remain the same}>
<l2, l2, 1 <= arg3 /\ arg1 <= 1 /\ arg3 <= 9 /\ arg2 = 1, {arg2 -> 1, arg3 -> 1 + arg3, rest remain the same}>
<l2, l2, arg1 <= 1 /\ arg3 = 0, {arg2 -> 1, arg3 -> 1, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef29 /\ 1 <= undef28 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = undef29, {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.621055

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008870s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.186102s
[40187 : 40188]
[40187 : 40189]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104998s
Time used: 4.10142
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, 0 <= undef29 /\ 1 <= undef28 /\ arg1 = 0 /\ arg2 = 0 /\ arg3 = undef29, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[40187 : 40301]
[40187 : 40305]
Successful child: 40305

Program does NOT terminate