/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, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l2, (arg1 < 31) /\ (arg1 < 25) /\ (arg1 > 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}>
<l2, l2, (arg1 < 31) /\ (arg1 > 25), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
<l2, l2, (25 = arg1), par{arg1 -> 29, arg2 -> undef8}>
<l2, l2, (arg1 > 30), par{arg1 -> 20, arg2 -> undef10}>
<l3, l1, true, par{arg1 -> undef11, arg2 -> undef12}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))>
<l2, l2, (arg1 < 31) /\ (arg1 < 25) /\ (arg1 > 10), par{arg1 -> (arg1 - 1)}>
<l2, l2, (arg1 < 31) /\ (arg1 > 25), par{arg1 -> (arg1 - 1)}>
<l2, l2, (25 = arg1), par{arg1 -> 29}>
<l2, l2, (arg1 > 30), par{arg1 -> 20}>

Fresh variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Undef variables:
undef2, undef4, undef6, undef8, undef10, undef11, undef12, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 <= 24 /\ 11 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 <= 30 /\ 26 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}>
<l2, l2, 31 <= arg1, {arg1 -> 20, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = undef12, {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.007113

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001446s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007332s
Piecewise ranking function: min(-418 + 38*arg1,532)
New Graphs: 
Transitions:
<l2, l2, arg1 <= 30 /\ 26 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000693s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009764s
[65213 : 65214]
[65213 : 65215]
Successful child: 65214
[ 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, arg1 <= 24 /\ 11 <= arg1, {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, arg1 <= 30 /\ 26 <= arg1, {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, arg1 = 25, {arg1 -> 29, 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 -> 20, 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, arg1 <= 30 /\ 26 <= arg1, {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, arg1 = 25, {arg1 -> 29, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l2, l2, 31 <= arg1, {arg1 -> 20, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l2, l2, arg1 <= 30 /\ 26 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000742s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009926s
[65213 : 65219]
[65213 : 65220]
Successful child: 65219
[ 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, arg1 <= 30 /\ 26 <= arg1, {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, arg1 = 25, {arg1 -> 29, 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, arg1 <= 30 /\ 26 <= arg1, {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, arg1 = 25, {arg1 -> 29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:31 <= arg1 - Process 2
* Exit transition: <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ 25 <= arg1 /\ arg1 = undef12, {all remain the same}>
* Postcondition  : 31 <= arg1

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000768s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 31 <= arg1 , 
Narrowing transition: 
<l2, l2, arg1 <= 30 /\ 26 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, arg1 = 25, {arg1 -> 29, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000740s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009932s
[65213 : 65224]
[65213 : 65225]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102649s
Time used: 4.1019

[65213 : 65229]
[65213 : 65232]
Successful child: 65232

Program does NOT terminate