Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990147
details
property
value
status
complete
benchmark
minmax.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n068.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.224161 seconds
cpu usage
0.142492
user time
0.127138
system time
0.015354
max virtual memory
113176.0
max residence set size
10904.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(1))
output
0.03/0.12 WORST_CASE(?,O(1)) 0.03/0.12 0.03/0.12 Preprocessing Cost Relations 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 #### Computed strongly connected components 0.03/0.12 0. non_recursive : [f54/12] 0.03/0.12 1. non_recursive : [f11/12] 0.03/0.12 2. non_recursive : [f38/12] 0.03/0.12 3. non_recursive : [f0/12] 0.03/0.12 0.03/0.12 #### Obtained direct recursion through partial evaluation 0.03/0.12 0. SCC is completely evaluated into other SCCs 0.03/0.12 1. SCC is partially evaluated into f11/12 0.03/0.12 2. SCC is partially evaluated into f38/12 0.03/0.12 3. SCC is partially evaluated into f0/12 0.03/0.12 0.03/0.12 Control-Flow Refinement of Cost Relations 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 ### Specialization of cost equations f11/12 0.03/0.12 * CE 4 is refined into CE [6] 0.03/0.12 * CE 5 is refined into CE [7] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of f11/12 0.03/0.12 * CEs [6] --> Loop 6 0.03/0.12 * CEs [7] --> Loop 7 0.03/0.12 0.03/0.12 ### Ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR f11(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 0.03/0.12 ### Specialization of cost equations f38/12 0.03/0.12 * CE 2 is discarded (unfeasible) 0.03/0.12 * CE 3 is refined into CE [8,9] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of f38/12 0.03/0.12 * CEs [8,9] --> Loop 8 0.03/0.12 0.03/0.12 ### Ranking functions of CR f38(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR f38(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 0.03/0.12 ### Specialization of cost equations f0/12 0.03/0.12 * CE 1 is refined into CE [10] 0.03/0.12 0.03/0.12 0.03/0.12 ### Cost equations --> "Loop" of f0/12 0.03/0.12 * CEs [10] --> Loop 9 0.03/0.12 0.03/0.12 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,K,N) 0.03/0.12 0.03/0.12 0.03/0.12 Computing Bounds 0.03/0.12 ===================================== 0.03/0.12 0.03/0.12 #### Cost of chains of f11(A,B,C,D,E,F,G,H,I,J,K,N): 0.03/0.12 * Chain [7]: 0 0.03/0.12 with precondition: [B=2,D=1,E=10,F=1,G=1,I=10,J=2,1>=A] 0.03/0.12 0.03/0.12 * Chain [6]: 0 0.03/0.12 with precondition: [B=2,D=1,E=10,F=1,G=1,I=10,J=2,A>=2] 0.03/0.12 0.03/0.12 0.03/0.12 #### Cost of chains of f38(A,B,C,D,E,F,G,H,I,J,K,N): 0.03/0.12 * Chain [8]: 0 0.03/0.12 with precondition: [A=1,B=2,D=1,E=10,I=10,J=2] 0.03/0.12 0.03/0.12 0.03/0.12 #### Cost of chains of f0(A,B,C,D,E,F,G,H,I,J,K,N): 0.03/0.12 * Chain [9]: 0 0.03/0.12 with precondition: [] 0.03/0.12 0.03/0.12 0.03/0.12 Closed-form bounds of f0(A,B,C,D,E,F,G,H,I,J,K,N): 0.03/0.12 ------------------------------------- 0.03/0.12 * Chain [9] with precondition: [] 0.03/0.12 - Upper bound: 0 0.03/0.12 - Complexity: constant 0.03/0.12 0.03/0.12 ### Maximum cost of f0(A,B,C,D,E,F,G,H,I,J,K,N): 0 0.03/0.12 Asymptotic class: constant 0.03/0.12 * Total analysis performed in 58 ms. 0.03/0.12 0.03/0.22 EOF
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