/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 < 15), par{arg2 -> undef4}>
<l3, l2, (arg1 < 15) /\ (((arg1 + 1) - (10 * undef7)) < 10) /\ (((arg1 + 1) - (10 * undef7)) >= 0), par{arg1 -> ((arg1 + 1) - (10 * undef7)), arg2 -> undef6}>
<l4, l1, true, par{arg1 -> undef8, arg2 -> undef9}>

Fresh variables:
undef2, undef4, undef6, undef7, undef8, undef9, 

Undef variables:
undef2, undef4, undef6, undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef9) /\ (undef8 > 0) /\ (undef9 > ~(1))>
<l2, l2, (arg1 < 15) /\ (arg1 < 15) /\ (((arg1 + 1) - (10 * undef7)) < 10) /\ (((arg1 + 1) - (10 * undef7)) >= 0), par{arg1 -> ((arg1 + 1) - (10 * undef7))}>

Fresh variables:
undef2, undef4, undef6, undef7, undef8, undef9, 

Undef variables:
undef2, undef4, undef6, undef7, undef8, undef9, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 = undef9, {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.001853

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000657s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002458s
[43168 : 43169]
[43168 : 43170]
Successful child: 43169
[ 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, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000564s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 15 <= arg1 , 
Narrowing transition: 
<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000643s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002521s
[43168 : 43174]
[43168 : 43175]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004969s
Time used: 0.00462

[43168 : 43179]
[43168 : 43180]
Successful child: 43179

Program does NOT terminate