/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, ((arg2 + 28) > arg2) /\ (arg2 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 28), arg2 -> undef2}>
<l2, l2, (arg1 > 35), par{arg1 -> 0, arg2 -> undef4}>
<l2, l2, (arg1 < 31) /\ (arg1 < 36) /\ (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
<l2, l2, (arg1 > 30) /\ (arg1 < 36), par{arg1 -> 35, 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, (arg1 = (undef10 + 28)) /\ ((undef10 + 28) > undef10) /\ (undef10 > ~(1)) /\ (undef9 > 0)>
<l2, l2, (arg1 > 35), par{arg1 -> 0}>
<l2, l2, (arg1 < 31) /\ (arg1 < 36) /\ (arg1 > 0), par{arg1 -> (arg1 - 1)}>
<l2, l2, (arg1 > 30) /\ (arg1 < 36), par{arg1 -> 35}>

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, 36 <= arg1, {arg1 -> 0, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 <= 30, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef9 /\ 0 <= undef10 /\ arg1 = 28 + undef10, {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.006005

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001186s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014047s
Piecewise ranking function: min(60,-2 + 2*arg1)
New Graphs: 
Transitions:
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000470s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001495s
[30196 : 30209]
[30196 : 30210]
Successful child: 30209
[ 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, 36 <= arg1, {arg1 -> 0, 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 <= 30, {arg1 -> -1 + arg1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, 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, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000640s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 30 , 
It's unfeasible. Removing transition: 
<l2, l2, 36 <= arg1, {arg1 -> 0, rest remain the same}>
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ arg1 <= 30, {arg1 -> -1 + arg1, rest remain the same}>
Narrowing transition: 
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000503s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001593s
[30196 : 30257]
[30196 : 30258]
Successful child: 30257
[ 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, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:36 <= arg1 - Process 2
* Exit transition: <l0, l2, 1 <= undef9 /\ 0 <= undef10 /\ 31 <= arg1 /\ arg1 = 28 + undef10, {all remain the same}>
* Postcondition  : 36 <= arg1

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000766s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 36 <= arg1 , 
Narrowing transition: 
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 31 <= arg1 /\ arg1 <= 35, {arg1 -> 35, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000504s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001625s
[30196 : 30290]
[30196 : 30291]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102618s
Time used: 4.10178

[30196 : 30419]
[30196 : 30422]
Successful child: 30422

Program does NOT terminate