Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429991129
details
property
value
status
complete
benchmark
random1d.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
WTC
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.241611 seconds
cpu usage
0.159997
user time
0.143349
system time
0.016648
max virtual memory
113176.0
max residence set size
11156.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
0.03/0.13 WORST_CASE(?,O(n^1)) 0.03/0.13 0.03/0.13 Preprocessing Cost Relations 0.03/0.13 ===================================== 0.03/0.13 0.03/0.13 #### Computed strongly connected components 0.03/0.13 0. recursive : [evalrandom1dbb1in/4,evalrandom1dbb5in/4] 0.03/0.13 1. non_recursive : [evalrandom1dstop/3] 0.03/0.13 2. non_recursive : [evalrandom1dreturnin/3] 0.03/0.13 3. non_recursive : [exit_location/1] 0.03/0.13 4. non_recursive : [evalrandom1dbb5in_loop_cont/4] 0.03/0.13 5. non_recursive : [evalrandom1dentryin/3] 0.03/0.13 6. non_recursive : [evalrandom1dstart/3] 0.03/0.13 0.03/0.13 #### Obtained direct recursion through partial evaluation 0.03/0.13 0. SCC is partially evaluated into evalrandom1dbb5in/4 0.03/0.13 1. SCC is completely evaluated into other SCCs 0.03/0.13 2. SCC is completely evaluated into other SCCs 0.03/0.13 3. SCC is completely evaluated into other SCCs 0.03/0.13 4. SCC is partially evaluated into evalrandom1dbb5in_loop_cont/4 0.03/0.13 5. SCC is partially evaluated into evalrandom1dentryin/3 0.03/0.13 6. SCC is partially evaluated into evalrandom1dstart/3 0.03/0.13 0.03/0.13 Control-Flow Refinement of Cost Relations 0.03/0.13 ===================================== 0.03/0.13 0.03/0.13 ### Specialization of cost equations evalrandom1dbb5in/4 0.03/0.13 * CE 6 is refined into CE [9] 0.03/0.13 * CE 5 is refined into CE [10] 0.03/0.13 * CE 4 is refined into CE [11] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of evalrandom1dbb5in/4 0.03/0.13 * CEs [11] --> Loop 9 0.03/0.13 * CEs [9] --> Loop 10 0.03/0.13 * CEs [10] --> Loop 11 0.03/0.13 0.03/0.13 ### Ranking functions of CR evalrandom1dbb5in(A,B,D,E) 0.03/0.13 * RF of phase [9]: [A-B+1] 0.03/0.13 0.03/0.13 #### Partial ranking functions of CR evalrandom1dbb5in(A,B,D,E) 0.03/0.13 * Partial RF of phase [9]: 0.03/0.13 - RF of loop [9:1]: 0.03/0.13 A-B+1 0.03/0.13 0.03/0.13 0.03/0.13 ### Specialization of cost equations evalrandom1dbb5in_loop_cont/4 0.03/0.13 * CE 8 is refined into CE [12] 0.03/0.13 * CE 7 is refined into CE [13] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of evalrandom1dbb5in_loop_cont/4 0.03/0.13 * CEs [12] --> Loop 12 0.03/0.13 * CEs [13] --> Loop 13 0.03/0.13 0.03/0.13 ### Ranking functions of CR evalrandom1dbb5in_loop_cont(A,B,C,D) 0.03/0.13 0.03/0.13 #### Partial ranking functions of CR evalrandom1dbb5in_loop_cont(A,B,C,D) 0.03/0.13 0.03/0.13 0.03/0.13 ### Specialization of cost equations evalrandom1dentryin/3 0.03/0.13 * CE 3 is refined into CE [14,15,16] 0.03/0.13 * CE 2 is refined into CE [17] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of evalrandom1dentryin/3 0.03/0.13 * CEs [14,15,16] --> Loop 14 0.03/0.13 * CEs [17] --> Loop 15 0.03/0.13 0.03/0.13 ### Ranking functions of CR evalrandom1dentryin(A,B,D) 0.03/0.13 0.03/0.13 #### Partial ranking functions of CR evalrandom1dentryin(A,B,D) 0.03/0.13 0.03/0.13 0.03/0.13 ### Specialization of cost equations evalrandom1dstart/3 0.03/0.13 * CE 1 is refined into CE [18,19] 0.03/0.13 0.03/0.13 0.03/0.13 ### Cost equations --> "Loop" of evalrandom1dstart/3 0.03/0.13 * CEs [19] --> Loop 16 0.03/0.13 * CEs [18] --> Loop 17 0.03/0.14 0.03/0.14 ### Ranking functions of CR evalrandom1dstart(A,B,D) 0.03/0.14 0.03/0.14 #### Partial ranking functions of CR evalrandom1dstart(A,B,D) 0.03/0.14 0.03/0.14 0.03/0.14 Computing Bounds 0.03/0.14 ===================================== 0.03/0.14 0.03/0.14 #### Cost of chains of evalrandom1dbb5in(A,B,D,E): 0.03/0.14 * Chain [[9],11]: 1*it(9)+0 0.03/0.14 Such that:it(9) =< -B+E 0.03/0.14 0.03/0.14 with precondition: [D=2,A+1=E,B>=1,A>=B] 0.03/0.14 0.03/0.14 * Chain [[9],10]: 1*it(9)+0 0.03/0.14 Such that:it(9) =< A-B+1 0.03/0.14 0.03/0.14 with precondition: [D=3,B>=1,A>=B]
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