/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, l10, true>
<l1, l2, (30 <= (0 + a4^0)) /\ (undef6 = 1), par{answer^0 -> (0 + undef6), ret_complex6^0 -> undef6}>
<l1, l3, ((1 + a4^0) <= 30)>
<l4, l1, true>
<l3, l5, true>
<l6, l3, (13 <= (0 + b5^0)), par{a4^0 -> (1 + a4^0)}>
<l6, l3, ((0 + b5^0) <= 12), par{a4^0 -> (10 + a4^0)}>
<l7, l3, ((1 + b5^0) <= 10), par{a4^0 -> (1 + a4^0)}>
<l7, l6, (10 <= (0 + b5^0))>
<l8, l7, ((0 + b5^0) <= 5), par{b5^0 -> (2 + b5^0)}>
<l8, l7, (6 <= (0 + b5^0)) /\ (undef58 = undef58), par{b5^0 -> undef58}>
<l5, l4, ((0 + a4^0) <= (0 + b5^0)), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
<l5, l8, ((1 + b5^0) <= (0 + a4^0))>
<l9, l4, (undef74 = 1) /\ (undef77 = 1), par{a4^0 -> (0 + undef74), a^0 -> undef74, answer^0 -> 0, b5^0 -> (0 + undef77), b^0 -> undef77}>
<l10, l9, true>

Fresh variables:
undef6, undef58, undef74, undef77, 

Undef variables:
undef6, undef58, undef74, undef77, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (a4^0 = (0 + undef74)) /\ (b5^0 = (0 + undef77)) /\ (undef74 = 1) /\ (undef77 = 1) /\ ((1 + (0 + undef74)) <= 30)>
<l3, l2, ((0 + a4^0) <= (0 + b5^0)) /\ (30 <= (0 + (2 + a4^0))) /\ (undef6 = 1), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
<l3, l3, ((0 + a4^0) <= (0 + b5^0)) /\ ((1 + (2 + a4^0)) <= 30), par{a4^0 -> (2 + a4^0), b5^0 -> (~(10) + b5^0)}>
<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ ((0 + b5^0) <= 5) /\ ((1 + (2 + b5^0)) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> (2 + b5^0)}>
<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 10), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}>
<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ (13 <= (0 + undef58)), par{a4^0 -> (1 + a4^0), b5^0 -> undef58}>
<l3, l3, ((1 + b5^0) <= (0 + a4^0)) /\ (6 <= (0 + b5^0)) /\ (undef58 = undef58) /\ (10 <= (0 + undef58)) /\ ((0 + undef58) <= 12), par{a4^0 -> (10 + a4^0), b5^0 -> undef58}>

Fresh variables:
undef6, undef58, undef74, undef77, 

Undef variables:
undef6, undef58, undef74, undef77, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, a4^0 <= b5^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
Variables:
a4^0, b5^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>

Graph 2
<l3, l2, a4^0 <= b5^0 /\ 28 <= a4^0 /\ undef6 = 1, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 2 )
( 3 , 1 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 4.10037

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008930s
Ranking function: 81 - 3*a4^0
New Graphs: 
Transitions:
<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
Variables:
a4^0, b5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002098s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.081732s
[1569 : 1638]
[1569 : 1639]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.061864s
Time used: 0.060307
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002891s
Time used: 1.00275

LOG: SAT solveNonLinear - Elapsed time: 1.064755s
Cost: 1; Total time: 1.06306
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= a4^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, a4^0 <= b5^0 /\ 0 <= a4^0 /\ a4^0 <= 27, {a4^0 -> 2 + a4^0, b5^0 -> -10 + b5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ b5^0 <= 5, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= a4^0 /\ 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
Quasi-ranking function: 50000 - a4^0
New Graphs: 
Transitions:
<l3, l3, 1 + b5^0 <= a4^0 /\ b5^0 <= 5 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> 2 + b5^0, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 6 <= b5^0 /\ undef58 <= 9 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 13 <= undef58 /\ 6 <= b5^0 /\ 50001 <= a4^0, {a4^0 -> 1 + a4^0, b5^0 -> undef58, rest remain the same}>
<l3, l3, 1 + b5^0 <= a4^0 /\ 10 <= undef58 /\ 6 <= b5^0 /\ undef58 <= 12 /\ 50001 <= a4^0, {a4^0 -> 10 + a4^0, b5^0 -> undef58, rest remain the same}>
Variables:
a4^0, b5^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002413s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.133790s
[1569 : 1667]
[1569 : 1668]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103355s
Time used: 4.101
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l3, a4^0 = undef74 /\ b5^0 = undef77 /\ undef74 = 1 /\ undef77 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[1569 : 1852]
[1569 : 1859]
Successful child: 1852

Program does NOT terminate