/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, l4, true>
<l1, l2, (1 <= (1 + len_98^0)) /\ (1 <= (0 + len_98^0)) /\ (undef5 = undef5) /\ (undef1 = (0 + l_11^0)) /\ (1 <= (1 + undef5)) /\ (1 <= (0 + undef5)) /\ (undef3 = undef3) /\ (0 <= (0 + (~(1) * undef1))) /\ ((0 + (~(1) * undef1)) <= 0), par{elem_13^0 -> undef1, l_11^0 -> (0 + x_12^0), len_98^0 -> undef3}>
<l2, l1, true>
<l3, l1, true>
<l4, l3, true>

Fresh variables:
undef1, undef3, undef5, 

Undef variables:
undef1, undef3, undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l1, (1 <= (1 + len_98^0)) /\ (1 <= (0 + len_98^0)) /\ (undef5 = undef5) /\ (undef1 = (0 + l_11^0)) /\ (1 <= (1 + undef5)) /\ (1 <= (0 + undef5)) /\ (undef3 = undef3) /\ (0 <= (0 + (~(1) * undef1))) /\ ((0 + (~(1) * undef1)) <= 0), par{l_11^0 -> (0 + x_12^0), len_98^0 -> undef3}>

Fresh variables:
undef1, undef3, undef5, 

Undef variables:
undef1, undef3, undef5, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000723s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002622s
[65526 : 65528]
[65526 : 65529]
Successful child: 65528
[ 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + len_98^0 <= l_11^0 - Process 1
* Exit transition: <l0, l1, true, {all remain the same}>
* Postcondition  : 1 + len_98^0 <= l_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000406s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + len_98^0 <= l_11^0 , 
Narrowing transition: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000779s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002880s
[65526 : 304]
[65526 : 305]
Successful child: 304
[ 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + l_11^0 <= 0 - Process 2
* Exit transition: <l0, l1, l_11^0 <= len_98^0, {all remain the same}>
* Postcondition  : 1 + l_11^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000531s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + l_11^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000827s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003088s
[65526 : 309]
[65526 : 310]
Successful child: 309
[ 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 <= l_11^0 - Process 3
* Exit transition: <l0, l1, l_11^0 <= len_98^0 /\ 0 <= l_11^0, {all remain the same}>
* Postcondition  : 1 <= l_11^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000634s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= l_11^0 , 
Narrowing transition: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= l_11^0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000787s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002912s
[65526 : 314]
[65526 : 315]
Successful child: 314
[ 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, 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: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:l_11^0 + len_98^0 <= 0 - Process 4
* Exit transition: <l0, l1, l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
* Postcondition  : l_11^0 + len_98^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000667s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: l_11^0 + len_98^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000859s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003232s
[65526 : 319]
[65526 : 320]
Successful child: 319
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, 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): 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 + x_12^0 <= 0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Ranking function: l_11^0
New Graphs: 

LOG: CALL check - Post:1 + x_12^0 <= 0 - Process 5
* Exit transition: <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0, {all remain the same}>
* Postcondition  : 1 + x_12^0 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000510s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 + x_12^0 <= 0 , 
Narrowing transition: 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000944s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003645s
[65526 : 324]
[65526 : 325]
Successful child: 324
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, 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): 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= l_11^0 + x_12^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Ranking function: -l_11^0
New Graphs: 

LOG: CALL check - Post:1 <= l_11^0 + x_12^0 - Process 6
* Exit transition: <l0, l1, 1 <= l_11^0 + len_98^0 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0, {all remain the same}>
* Postcondition  : 1 <= l_11^0 + x_12^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000575s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 1 <= l_11^0 + x_12^0 , 
Narrowing transition: 
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 <= l_11^0 + len_98^0 /\ 1 <= len_98^0 /\ 1 <= undef5 /\ l_11^0 <= len_98^0 /\ l_11^0 + x_12^0 <= 0 /\ 0 <= x_12^0 /\ l_11^0 = 0 /\ l_11^0 = undef1 /\ undef1 = 0, {l_11^0 -> x_12^0, len_98^0 -> undef3, rest remain the same}>
Variables:
l_11^0, len_98^0, x_12^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001004s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003794s
[65526 : 329]
[65526 : 333]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009330s
Time used: 0.008762

[65526 : 456]
[65526 : 462]
Successful child: 456

Program does NOT terminate