details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.81855 seconds
cpu usage	13.161
user time	12.6555
system time	0.505497
max virtual memory	1.8779656E7
max residence set size	245168.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

12.89/5.75 WORST_CASE(NON_POLY, ?) 13.11/5.77 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 13.11/5.77 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.11/5.77 13.11/5.77 13.11/5.77 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF). 13.11/5.77 13.11/5.77 (0) CpxIntTrs 13.11/5.77 (1) Loat Proof [FINISHED, 4010 ms] 13.11/5.77 (2) BOUNDS(INF, INF) 13.11/5.77 13.11/5.77 13.11/5.77 ---------------------------------------- 13.11/5.77 13.11/5.77 (0) 13.11/5.77 Obligation: 13.11/5.77 Complexity Int TRS consisting of the following rules: 13.11/5.77 f25(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f15(A, B, C + 1, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: A >= B + 1 13.11/5.77 f25(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f15(A, B, C + 1, Y, 0, 1, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: B >= A 13.11/5.77 f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: TRUE 13.11/5.77 f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, 1, D, E, F, 0, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: TRUE 13.11/5.77 f36(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f45(A, B, C, D, E, F, G, H, Y, Z, A1, B1, B1, N, O, P, Q, R, S, T, U, V, W, X)) :|: H >= C 13.11/5.77 f45(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f46(A, B, C, D, E, F, G, H, I, J, K, L, M, M, O, P, Q, R, S, T, U, V, W, X)) :|: 0 >= M + 1 13.11/5.77 f45(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f46(A, B, C, D, E, F, G, H, I, J, K, L, M, M, O, P, Q, R, S, T, U, V, W, X)) :|: M >= 1 13.11/5.77 f46(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, C + 1, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: A >= B + 1 13.11/5.77 f45(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, C + 1, D, E, F, G, H, I, J, K, L, 0, 0, O, P, Q, R, S, T, U, V, W, X)) :|: M >= 0 && M <= 0 13.11/5.77 f61(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f61(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: TRUE 13.11/5.77 f63(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f65(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: TRUE 13.11/5.77 f46(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, C + 1, Y, 0, F, G, H, I, J, K, L, M, N, Z, P, Q, R, S, T, U, V, W, X)) :|: B >= A 13.11/5.77 f46(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f45(A, B, C, D, E, F, G, H, I, Y, Z, A1, A1, N, O, B1, Q, R, S, T, U, V, W, X)) :|: B >= A 13.11/5.77 f36(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f61(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, 0, R, S, T, U, V, W, X)) :|: C >= 1 + H 13.11/5.77 f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f25(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, Y, Z, A1, A1, A1, X)) :|: 0 >= A1 + 1 && R >= C + 1 13.11/5.77 f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f25(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, Y, Z, A1, A1, A1, X)) :|: A1 >= 1 && R >= C + 1 13.11/5.77 f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f15(A, B, C + 1, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, Y, Z, 0, 0, 0, X)) :|: R >= C + 1 13.11/5.77 f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X)) :|: C >= R 13.11/5.77 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f15(A, B, 0, D, E, F, 0, Z, I, J, K, L, M, N, O, P, 0, Y, S, T, U, V, W, 1)) :|: TRUE 13.11/5.77 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, 1, D, E, F, 0, A1, I, J, K, L, M, N, O, P, 0, Z, S, T, U, V, W, Y)) :|: 0 >= Y 13.11/5.77 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X) -> Com_1(f36(A, B, 1, D, E, F, 0, A1, I, J, K, L, M, N, O, P, 0, Z, S, T, U, V, W, Y)) :|: Y >= 2 13.11/5.77 13.11/5.77 The start-symbols are:[f0_24] 13.11/5.77 13.11/5.77 13.11/5.77 ---------------------------------------- 13.11/5.77 13.11/5.77 (1) Loat Proof (FINISHED) 13.11/5.77 13.11/5.77 13.11/5.77 ### Pre-processing the ITS problem ### 13.11/5.77 13.11/5.77 13.11/5.77 13.11/5.77 Initial linear ITS problem 13.11/5.77 13.11/5.77 Start location: f0 13.11/5.77 13.11/5.77 0: f25 -> f15 : C'=1+C, [ A>=1+B ], cost: 1 13.11/5.77 13.11/5.77 1: f25 -> f15 : C'=1+C, D'=free, E'=0, F'=1, [ B>=A ], cost: 1 13.11/5.77 13.11/5.77 2: f31 -> f31 : [], cost: 1 13.11/5.77 13.11/5.77 3: f33 -> f36 : C'=1, G'=0, [], cost: 1 13.11/5.77 13.11/5.77 4: f36 -> f45 : Q'=free_3, J'=free_1, K'=free_4, L'=free_2, M'=free_2, [ H>=C ], cost: 1 13.11/5.77 13.11/5.77 13: f36 -> f61 : Q_1'=0, [ C>=1+H ], cost: 1 13.11/5.77 13.11/5.77 5: f45 -> f46 : N'=M, [ 0>=1+M ], cost: 1 13.11/5.77 13.11/5.77 6: f45 -> f46 : N'=M, [ M>=1 ], cost: 1 13.11/5.77 13.11/5.77 8: f45 -> f36 : C'=1+C, M'=0, N'=0, [ M==0 ], cost: 1 13.11/5.77 13.11/5.77 7: f46 -> f36 : C'=1+C, [ A>=1+B ], cost: 1 13.11/5.77 13.11/5.77 11: f46 -> f36 : C'=1+C, D'=free_6, E'=0, O'=free_5, [ B>=A ], cost: 1 13.11/5.77 13.11/5.77 12: f46 -> f45 : J'=free_9, K'=free_7, L'=free_10, M'=free_10, P'=free_8, [ B>=A ], cost: 1 13.11/5.77 13.11/5.77 9: f61 -> f61 : [], cost: 1 13.11/5.77 13.11/5.77 10: f63 -> f65 : A1'=B, B'=C, B1'=D, C'=E, D'=F, E'=G, F'=H, G'=Q, H'=J, Q'=K, J'=L, K'=M, L'=N, M'=O, N'=P, O'=Q_1, P'=R, Q_1'=S, R'=T, S'=U, T'=V, U'=W, V'=X, [], cost: 1 13.11/5.77 13.11/5.77 14: f15 -> f25 : S'=free_12, T'=free_11, U'=free_13, V'=free_13, W'=free_13, [ 0>=1+free_13 && R>=1+C ], cost: 1 13.11/5.77 13.11/5.77 15: f15 -> f25 : S'=free_15, T'=free_14, U'=free_16, V'=free_16, W'=free_16, [ free_16>=1 && R>=1+C ], cost: 1 13.11/5.77 13.11/5.77 16: f15 -> f15 : C'=1+C, S'=free_18, T'=free_17, U'=0, V'=0, W'=0, [ R>=1+C ], cost: 1 13.11/5.77 13.11/5.77 17: f15 -> f31 : [ C>=R ], cost: 1 13.11/5.77 13.11/5.77 18: f0 -> f15 : C'=0, G'=0, H'=free_20, Q_1'=0, R'=free_19, X'=1, [], cost: 1 13.11/5.77 13.11/5.77 19: f0 -> f36 : C'=1, G'=0, H'=free_22, Q_1'=0, R'=free_21, X'=free_23, [ 0>=free_23 ], cost: 1 13.11/5.77 13.11/5.77 20: f0 -> f36 : C'=1, G'=0, H'=free_25, Q_1'=0, R'=free_24, X'=free_26, [ free_26>=2 ], cost: 1 13.11/5.77 13.11/5.77 13.11/5.77 13.11/5.77 Removed unreachable and leaf rules: 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