/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, l4, true>
<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
<l2, l3, ((arg1 - (2 * undef5)) = 0) /\ (arg1 > 0), par{arg2 -> undef4}>
<l3, l2, (arg1 > 0) /\ ((arg1 - (2 * undef8)) = 0) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1), arg2 -> undef7}>
<l2, l3, (arg1 > 0) /\ ((arg1 - (2 * undef11)) = 1), par{arg2 -> undef10}>
<l3, l2, ((arg1 - (2 * undef14)) = 1) /\ (arg1 > 0) /\ ((arg1 - (2 * undef14)) < 2) /\ ((arg1 - (2 * undef14)) >= 0), par{arg1 -> (arg1 + 3), arg2 -> undef13}>
<l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}>

Fresh variables:
undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 

Undef variables:
undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))>
<l2, l2, ((arg1 - (2 * undef5)) = 0) /\ (arg1 > 0) /\ (arg1 > 0) /\ ((arg1 - (2 * undef8)) = 0) /\ ((arg1 - (2 * undef8)) < 2) /\ ((arg1 - (2 * undef8)) >= 0), par{arg1 -> (arg1 - 1)}>
<l2, l2, (arg1 > 0) /\ ((arg1 - (2 * undef11)) = 1) /\ ((arg1 - (2 * undef14)) = 1) /\ (arg1 > 0) /\ ((arg1 - (2 * undef14)) < 2) /\ ((arg1 - (2 * undef14)) >= 0), par{arg1 -> (arg1 + 3)}>

Fresh variables:
undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 

Undef variables:
undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 

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 /\ arg1 = 2*undef5 /\ arg1 = 2*undef8, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 = 1 + 2*undef11 /\ arg1 = 1 + 2*undef14, {arg1 -> 3 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {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.003645

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000987s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005012s
[12327 : 12328]
[12327 : 12329]
Successful child: 12328
[ 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, 1 <= arg1 /\ arg1 = 2*undef5 /\ arg1 = 2*undef8, {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, 1 <= arg1 /\ arg1 = 1 + 2*undef11 /\ arg1 = 1 + 2*undef14, {arg1 -> 3 + 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
It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ arg1 = 2*undef5 /\ arg1 = 2*undef8, {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, 1 <= arg1 /\ arg1 = 1 + 2*undef11 /\ arg1 = 1 + 2*undef14, {arg1 -> 3 + arg1, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000587s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ arg1 = 2*undef5 /\ arg1 = 2*undef8, {arg1 -> -1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ arg1 = 1 + 2*undef11 /\ arg1 = 1 + 2*undef14, {arg1 -> 3 + arg1, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 <= arg1 /\ arg1 = 2*undef5 /\ arg1 = 2*undef8, {arg1 -> -1 + arg1, rest remain the same}>
<l2, l2, 1 <= arg1 /\ arg1 = 1 + 2*undef11 /\ arg1 = 1 + 2*undef14, {arg1 -> 3 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000975s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005074s
[12327 : 12333]
[12327 : 12334]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020545s
Time used: 0.020107

[12327 : 12346]
[12327 : 12347]
Successful child: 12346

Program does NOT terminate