Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744175
details
property
value
status
complete
benchmark
merge.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
misc
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.21515417099 seconds
cpu usage
0.127703474
max memory
8433664.0
stage attributes
key
value
output-size
2420
starexec-result
WORST_CASE(?,O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_its /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(n^1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [merge/3] 1. non_recursive : [exit_location/1] 2. non_recursive : [merge_loop_cont/2] 3. non_recursive : [start/3] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into merge/3 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is partially evaluated into start/3 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations merge/3 * CE 4 is refined into CE [5] * CE 2 is refined into CE [6] * CE 3 is refined into CE [7] ### Cost equations --> "Loop" of merge/3 * CEs [6] --> Loop 5 * CEs [7] --> Loop 6 * CEs [5] --> Loop 7 ### Ranking functions of CR merge(A,B,C) * RF of phase [5,6]: [A+B-1] #### Partial ranking functions of CR merge(A,B,C) * Partial RF of phase [5,6]: - RF of loop [5:1]: A - RF of loop [6:1]: B ### Specialization of cost equations start/3 * CE 1 is refined into CE [8,9] ### Cost equations --> "Loop" of start/3 * CEs [9] --> Loop 8 * CEs [8] --> Loop 9 ### Ranking functions of CR start(A,B,C) #### Partial ranking functions of CR start(A,B,C) Computing Bounds ===================================== #### Cost of chains of merge(A,B,C): * Chain [[5,6],7]: 1*it(5)+1*it(6)+0 Such that:it(5) =< A it(6) =< B aux(3) =< A+B it(5) =< aux(3) it(6) =< aux(3) with precondition: [C=2,A>=1,B>=1] * Chain [7]: 0 with precondition: [C=2] #### Cost of chains of start(A,B,C): * Chain [9]: 0 with precondition: [] * Chain [8]: 1*s(1)+1*s(2)+0 Such that:s(1) =< A s(3) =< A+B s(2) =< B s(1) =< s(3) s(2) =< s(3) with precondition: [A>=1,B>=1] Closed-form bounds of start(A,B,C): ------------------------------------- * Chain [9] with precondition: [] - Upper bound: 0 - Complexity: constant * Chain [8] with precondition: [A>=1,B>=1] - Upper bound: A+B - Complexity: n
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843