Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990373
details
property
value
status
complete
benchmark
byron-1.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.622821 seconds
cpu usage
0.169018
user time
0.147215
system time
0.021803
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.52 WORST_CASE(?,O(n^1)) 0.03/0.52 0.03/0.52 Preprocessing Cost Relations 0.03/0.52 ===================================== 0.03/0.52 0.03/0.52 #### Computed strongly connected components 0.03/0.52 0. recursive : [f2/7] 0.03/0.52 1. non_recursive : [exit_location/1] 0.03/0.52 2. non_recursive : [f4/4] 0.03/0.52 3. non_recursive : [f2_loop_cont/5] 0.03/0.52 4. non_recursive : [f3/4] 0.03/0.52 0.03/0.52 #### Obtained direct recursion through partial evaluation 0.03/0.52 0. SCC is partially evaluated into f2/7 0.03/0.52 1. SCC is completely evaluated into other SCCs 0.03/0.52 2. SCC is completely evaluated into other SCCs 0.03/0.52 3. SCC is partially evaluated into f2_loop_cont/5 0.03/0.52 4. SCC is partially evaluated into f3/4 0.03/0.52 0.03/0.52 Control-Flow Refinement of Cost Relations 0.03/0.52 ===================================== 0.03/0.52 0.03/0.52 ### Specialization of cost equations f2/7 0.03/0.52 * CE 5 is refined into CE [8] 0.03/0.52 * CE 4 is refined into CE [9] 0.03/0.52 * CE 3 is refined into CE [10] 0.03/0.52 0.03/0.52 0.03/0.52 ### Cost equations --> "Loop" of f2/7 0.03/0.52 * CEs [10] --> Loop 8 0.03/0.52 * CEs [8] --> Loop 9 0.03/0.52 * CEs [9] --> Loop 10 0.03/0.52 0.03/0.52 ### Ranking functions of CR f2(A,B,C,E,F,G,H) 0.03/0.52 * RF of phase [8]: [A] 0.03/0.52 0.03/0.52 #### Partial ranking functions of CR f2(A,B,C,E,F,G,H) 0.03/0.52 * Partial RF of phase [8]: 0.03/0.52 - RF of loop [8:1]: 0.03/0.52 A 0.03/0.52 0.03/0.52 0.03/0.52 ### Specialization of cost equations f2_loop_cont/5 0.03/0.52 * CE 7 is refined into CE [11] 0.03/0.52 * CE 6 is refined into CE [12] 0.03/0.52 0.03/0.52 0.03/0.52 ### Cost equations --> "Loop" of f2_loop_cont/5 0.03/0.52 * CEs [11] --> Loop 11 0.03/0.52 * CEs [12] --> Loop 12 0.03/0.52 0.03/0.52 ### Ranking functions of CR f2_loop_cont(A,B,C,D,E) 0.03/0.52 0.03/0.52 #### Partial ranking functions of CR f2_loop_cont(A,B,C,D,E) 0.03/0.52 0.03/0.52 0.03/0.52 ### Specialization of cost equations f3/4 0.03/0.52 * CE 2 is refined into CE [13,14,15,16] 0.03/0.52 * CE 1 is refined into CE [17] 0.03/0.52 0.03/0.52 0.03/0.52 ### Cost equations --> "Loop" of f3/4 0.03/0.52 * CEs [16] --> Loop 13 0.03/0.52 * CEs [14,15] --> Loop 14 0.03/0.52 * CEs [17] --> Loop 15 0.03/0.52 * CEs [13] --> Loop 16 0.03/0.52 0.03/0.52 ### Ranking functions of CR f3(A,B,C,E) 0.03/0.52 0.03/0.52 #### Partial ranking functions of CR f3(A,B,C,E) 0.03/0.52 0.03/0.52 0.03/0.52 Computing Bounds 0.03/0.52 ===================================== 0.03/0.52 0.03/0.52 #### Cost of chains of f2(A,B,C,E,F,G,H): 0.03/0.52 * Chain [[8],10]: 1*it(8)+0 0.03/0.52 Such that:it(8) =< A 0.03/0.52 0.03/0.52 with precondition: [E=2,0>=F,B>=1,G>=B+1,F+G>=2,A+B+2>=2*G+F] 0.03/0.52 0.03/0.52 * Chain [[8],9]: 1*it(8)+0 0.03/0.52 Such that:it(8) =< A 0.03/0.52 0.03/0.52 with precondition: [E=3,A>=1,B>=1] 0.03/0.52 0.03/0.52 * Chain [10]: 0 0.03/0.52 with precondition: [E=2,A=F,B=G,0>=A,B>=1] 0.03/0.52 0.03/0.52 * Chain [9]: 0 0.03/0.52 with precondition: [E=3,B>=1] 0.03/0.52 0.03/0.52 0.03/0.52 #### Cost of chains of f2_loop_cont(A,B,C,D,E): 0.03/0.52 * Chain [12]: 0 0.03/0.52 with precondition: [A=2] 0.03/0.52 0.03/0.52 * Chain [11]: 0 0.03/0.52 with precondition: [A=3] 0.03/0.52
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