Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744465
details
property
value
status
complete
benchmark
easy2.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
WTC
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.78271698952 seconds
cpu usage
3.849436552
max memory
2.47447552E8
stage attributes
key
value
output-size
6636
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, max(3, 3 + 3 * Arg_0) + max(1, 2 + 2 * Arg_0)). (0) CpxIntTrs (1) Koat2 Proof [FINISHED, 134 ms] (2) BOUNDS(1, max(3, 3 + 3 * Arg_0) + max(1, 2 + 2 * Arg_0)) (3) Loat Proof [FINISHED, 235 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: evaleasy2start(A) -> Com_1(evaleasy2entryin(A)) :|: TRUE evaleasy2entryin(A) -> Com_1(evaleasy2bb1in(A)) :|: TRUE evaleasy2bb1in(A) -> Com_1(evaleasy2bbin(A)) :|: A >= 1 evaleasy2bb1in(A) -> Com_1(evaleasy2returnin(A)) :|: 0 >= A evaleasy2bbin(A) -> Com_1(evaleasy2bb1in(A - 1)) :|: TRUE evaleasy2returnin(A) -> Com_1(evaleasy2stop(A)) :|: TRUE The start-symbols are:[evaleasy2start_1] ---------------------------------------- (1) Koat2 Proof (FINISHED) YES( ?, 3+max([0, 3*Arg_0])+max([1, 2+2*Arg_0]) {O(n)}) Initial Complexity Problem: Start: evaleasy2start Program_Vars: Arg_0 Temp_Vars: Locations: evaleasy2bb1in, evaleasy2bbin, evaleasy2entryin, evaleasy2returnin, evaleasy2start, evaleasy2stop Transitions: evaleasy2bb1in(Arg_0) -> evaleasy2bbin(Arg_0):|:1 <= Arg_0 evaleasy2bb1in(Arg_0) -> evaleasy2returnin(Arg_0):|:Arg_0 <= 0 evaleasy2bbin(Arg_0) -> evaleasy2bb1in(Arg_0-1):|:1 <= Arg_0 evaleasy2entryin(Arg_0) -> evaleasy2bb1in(Arg_0):|: evaleasy2returnin(Arg_0) -> evaleasy2stop(Arg_0):|:Arg_0 <= 0 evaleasy2start(Arg_0) -> evaleasy2entryin(Arg_0):|: Timebounds: Overall timebound: 3+max([0, 3*Arg_0])+max([1, 2+2*Arg_0]) {O(n)} 2: evaleasy2bb1in->evaleasy2bbin: max([0, 1+2*Arg_0]) {O(n)} 3: evaleasy2bb1in->evaleasy2returnin: 1 {O(1)} 4: evaleasy2bbin->evaleasy2bb1in: max([0, 3*Arg_0]) {O(n)} 1: evaleasy2entryin->evaleasy2bb1in: 1 {O(1)} 5: evaleasy2returnin->evaleasy2stop: 1 {O(1)} 0: evaleasy2start->evaleasy2entryin: 1 {O(1)} Costbounds: Overall costbound: 3+max([0, 3*Arg_0])+max([1, 2+2*Arg_0]) {O(n)} 2: evaleasy2bb1in->evaleasy2bbin: max([0, 1+2*Arg_0]) {O(n)} 3: evaleasy2bb1in->evaleasy2returnin: 1 {O(1)} 4: evaleasy2bbin->evaleasy2bb1in: max([0, 3*Arg_0]) {O(n)} 1: evaleasy2entryin->evaleasy2bb1in: 1 {O(1)} 5: evaleasy2returnin->evaleasy2stop: 1 {O(1)}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843