details

property	value
status	complete
benchmark	nakata_withassume.koat
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n172.star.cs.uiowa.edu
space	T2

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	10.4263 seconds
cpu usage	29.9375
user time	28.9644
system time	0.973105
max virtual memory	1.8953016E7
max residence set size	393060.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

29.76/10.38 WORST_CASE(NON_POLY, ?) 29.76/10.39 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 29.76/10.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.76/10.39 29.76/10.39 29.76/10.39 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 29.76/10.39 29.76/10.39 (0) CpxIntTrs 29.76/10.39 (1) Loat Proof [FINISHED, 8668 ms] 29.76/10.39 (2) BOUNDS(INF, INF) 29.76/10.39 29.76/10.39 29.76/10.39 ---------------------------------------- 29.76/10.39 29.76/10.39 (0) 29.76/10.39 Obligation: 29.76/10.39 Complexity Int TRS consisting of the following rules: 29.76/10.39 f0(A, B, C, D, E, F, G, H, I, J) -> Com_1(f16(1, 0, 1, N, 0, M, L, K, I, J)) :|: K >= 0 && L >= K && L >= 0 && M >= L && N >= 0 && M >= 0 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A, B, C, D, E + 1, F, G, H, 0, J)) :|: H >= 1 && 0 >= E && 0 >= D 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A, B, C, D, E, F, G, H, N, J)) :|: H >= 1 && E >= 2 && 0 >= D && 1 >= N && N >= 0 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A, B + 1, C, D, E, F, G, H, 1, J)) :|: H >= 1 && 0 >= D && 0 >= B && E >= 1 && E <= 1 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A, 0, C - 1, D, E, F, G, H, 0, J)) :|: H >= 1 && 0 >= D && C >= 1 && E >= 1 && E <= 1 && B >= 1 && B <= 1 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A + 1, 0, A + 1, N, 0, F, G, H, M, J)) :|: H >= 1 && 0 >= D && M >= 0 && 1 >= M && B >= 2 && N >= 0 && E >= 1 && E <= 1 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A + 1, 0, A + 1, N, 0, F, G, H, M, J)) :|: H >= 1 && 0 >= D && 0 >= C && M >= 0 && 1 >= M && N >= 0 && E >= 1 && E <= 1 && B >= 1 && B <= 1 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f25(A, B, C, D - 1, E, F, G, H, N, J)) :|: H >= 1 && D >= 1 && 1 >= N && N >= 0 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A, B, C, D, E + 1, F, G, H, I, 0)) :|: I >= 1 && 0 >= E && 0 >= D 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A, B, C, D, E, F, G, H, I, N)) :|: I >= 1 && E >= 2 && 0 >= D && 1 >= N && N >= 0 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A, B + 1, C, D, E, F, G, H, I, 1)) :|: I >= 1 && 0 >= D && 0 >= B && E >= 1 && E <= 1 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A, 0, C - 1, D, E, F, G, H, I, 0)) :|: I >= 1 && 0 >= D && C >= 1 && E >= 1 && E <= 1 && B >= 1 && B <= 1 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A + 1, 0, A + 1, N, 0, F, G, H, I, M)) :|: I >= 1 && 0 >= D && M >= 0 && 1 >= M && B >= 2 && N >= 0 && E >= 1 && E <= 1 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A + 1, 0, A + 1, N, 0, F, G, H, I, M)) :|: I >= 1 && 0 >= D && 0 >= C && M >= 0 && 1 >= M && N >= 0 && E >= 1 && E <= 1 && B >= 1 && B <= 1 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f50(A, B, C, D - 1, E, F, G, H, I, N)) :|: I >= 1 && D >= 1 && 1 >= N && N >= 0 29.76/10.39 f25(A, B, C, D, E, F, G, H, I, J) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J)) :|: F + 1 >= A && 0 >= I 29.76/10.39 f50(A, B, C, D, E, F, G, H, I, J) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J)) :|: J >= 1 && F + 1 >= A && H >= G 29.76/10.39 f50(A, B, C, D, E, F, G, H, I, J) -> Com_1(f16(A, B, C, D, E, F, G, H + 1, I, J)) :|: J >= 1 && F + 1 >= A && G >= H + 1 29.76/10.39 f50(A, B, C, D, E, F, G, H, I, J) -> Com_1(f16(A, B, C, D, E, F, G, H - 1, I, J)) :|: F + 1 >= A && 0 >= J 29.76/10.39 f16(A, B, C, D, E, F, G, H, I, J) -> Com_1(f74(A, B, C, D, E, F, G, H, I, J)) :|: 0 >= H 29.76/10.39 29.76/10.39 The start-symbols are:[f0_10] 29.76/10.39 29.76/10.39 29.76/10.39 ---------------------------------------- 29.76/10.39 29.76/10.39 (1) Loat Proof (FINISHED) 29.76/10.39 29.76/10.39 29.76/10.39 ### Pre-processing the ITS problem ### 29.76/10.39 29.76/10.39 29.76/10.39 29.76/10.39 Initial linear ITS problem 29.76/10.39 29.76/10.39 Start location: f0 29.76/10.39 29.76/10.39 0: f0 -> f16 : A'=1, B'=0, C'=1, D'=free_2, E'=0, F'=free_1, G'=free, H'=free_3, [ free_3>=0 && free>=free_3 && free>=0 && free_1>=free && free_2>=0 && free_1>=0 ], cost: 1 29.76/10.39 29.76/10.39 1: f16 -> f25 : E'=1+E, Q'=0, [ H>=1 && 0>=E && 0>=D ], cost: 1 29.76/10.39 29.76/10.39 2: f16 -> f25 : Q'=free_4, [ H>=1 && E>=2 && 0>=D && 1>=free_4 && free_4>=0 ], cost: 1 29.76/10.39 29.76/10.39 3: f16 -> f25 : B'=1+B, Q'=1, [ H>=1 && 0>=D && 0>=B && E==1 ], cost: 1 29.76/10.39 29.76/10.39 4: f16 -> f25 : B'=0, C'=-1+C, Q'=0, [ H>=1 && 0>=D && C>=1 && E==1 && B==1 ], cost: 1 29.76/10.39 29.76/10.39 5: f16 -> f25 : A'=1+A, B'=0, C'=1+A, D'=free_6, E'=0, Q'=free_5, [ H>=1 && 0>=D && free_5>=0 && 1>=free_5 && B>=2 && free_6>=0 && E==1 ], cost: 1 29.76/10.39 29.76/10.39 6: f16 -> f25 : A'=1+A, B'=0, C'=1+A, D'=free_8, E'=0, Q'=free_7, [ H>=1 && 0>=D && 0>=C && free_7>=0 && 1>=free_7 && free_8>=0 && E==1 && B==1 ], cost: 1 29.76/10.39 29.76/10.39 7: f16 -> f25 : D'=-1+D, Q'=free_9, [ H>=1 && D>=1 && 1>=free_9 && free_9>=0 ], cost: 1 29.76/10.39 29.76/10.39 19: f16 -> f74 : [ 0>=H ], cost: 1 29.76/10.39 29.76/10.39 8: f25 -> f50 : E'=1+E, J'=0, [ Q>=1 && 0>=E && 0>=D ], cost: 1 29.76/10.39 29.76/10.39 9: f25 -> f50 : J'=free_10, [ Q>=1 && E>=2 && 0>=D && 1>=free_10 && free_10>=0 ], cost: 1 29.76/10.39 29.76/10.39 10: f25 -> f50 : B'=1+B, J'=1, [ Q>=1 && 0>=D && 0>=B && E==1 ], cost: 1 29.76/10.39 29.76/10.39 11: f25 -> f50 : B'=0, C'=-1+C, J'=0, [ Q>=1 && 0>=D && C>=1 && E==1 && B==1 ], cost: 1 29.76/10.39 29.76/10.39 12: f25 -> f50 : A'=1+A, B'=0, C'=1+A, D'=free_12, E'=0, J'=free_11, [ Q>=1 && 0>=D && free_11>=0 && 1>=free_11 && B>=2 && free_12>=0 && E==1 ], cost: 1 29.76/10.39 29.76/10.39 13: f25 -> f50 : A'=1+A, B'=0, C'=1+A, D'=free_14, E'=0, J'=free_13, [ Q>=1 && 0>=D && 0>=C && free_13>=0 && 1>=free_13 && free_14>=0 && E==1 && B==1 ], cost: 1 29.76/10.39 29.76/10.39 14: f25 -> f50 : D'=-1+D, J'=free_15, [ Q>=1 && D>=1 && 1>=free_15 && free_15>=0 ], cost: 1 29.76/10.39 29.76/10.39 15: f25 -> f16 : [ 1+F>=A && 0>=Q ], cost: 1 29.76/10.39 29.76/10.39 16: f50 -> f16 : [ J>=1 && 1+F>=A && H>=G ], cost: 1 29.76/10.39 29.76/10.39 17: f50 -> f16 : H'=1+H, [ J>=1 && 1+F>=A && G>=1+H ], cost: 1 29.76/10.39 29.76/10.39 18: f50 -> f16 : H'=-1+H, [ 1+F>=A && 0>=J ], cost: 1 29.76/10.39 29.76/10.39 29.76/10.39 29.76/10.39 Removed unreachable and leaf rules: 29.76/10.39 29.76/10.39 Start location: f0 29.76/10.39 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Complexity_ITS 2019-03-21 04.46