Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_ITS 2019-03-21 04.46 pair #429990611
details
property
value
status
complete
benchmark
neg-e-pgarch-succeed.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n003.star.cs.uiowa.edu
space
T2
run statistics
property
value
solver
CoFloCo 2018
configuration
its
runtime (wallclock)
0.248959 seconds
cpu usage
0.167535
user time
0.14455
system time
0.022985
max virtual memory
113176.0
max residence set size
11036.0
stage attributes
key
value
starexec-result
MAYBE
output
0.04/0.14 MAYBE 0.04/0.14 0.04/0.14 Preprocessing Cost Relations 0.04/0.14 ===================================== 0.04/0.14 0.04/0.14 #### Computed strongly connected components 0.04/0.14 0. recursive : [f31/1] 0.04/0.14 1. non_recursive : [exit_location/1] 0.04/0.14 2. non_recursive : [f31_loop_cont/2] 0.04/0.14 3. non_recursive : [f24/11] 0.04/0.14 4. non_recursive : [f18/11] 0.04/0.14 5. non_recursive : [f0/11] 0.04/0.14 0.04/0.14 #### Obtained direct recursion through partial evaluation 0.04/0.14 0. SCC is partially evaluated into f31/1 0.04/0.14 1. SCC is completely evaluated into other SCCs 0.04/0.14 2. SCC is completely evaluated into other SCCs 0.04/0.14 3. SCC is partially evaluated into f24/11 0.04/0.14 4. SCC is partially evaluated into f18/11 0.04/0.14 5. SCC is partially evaluated into f0/11 0.04/0.14 0.04/0.14 Control-Flow Refinement of Cost Relations 0.04/0.14 ===================================== 0.04/0.14 0.04/0.14 ### Specialization of cost equations f31/1 0.04/0.14 * CE 7 is refined into CE [10] 0.04/0.14 * CE 6 is refined into CE [11] 0.04/0.14 0.04/0.14 0.04/0.14 ### Cost equations --> "Loop" of f31/1 0.04/0.14 * CEs [11] --> Loop 8 0.04/0.14 * CEs [10] --> Loop 9 0.04/0.14 0.04/0.14 ### Ranking functions of CR f31(M) 0.04/0.14 0.04/0.14 #### Partial ranking functions of CR f31(M) 0.04/0.14 0.04/0.14 0.04/0.14 ### Specialization of cost equations f24/11 0.04/0.14 * CE 8 is discarded (unfeasible) 0.04/0.14 * CE 9 is refined into CE [12,13] 0.04/0.14 0.04/0.14 0.04/0.14 ### Cost equations --> "Loop" of f24/11 0.04/0.14 * CEs [13] --> Loop 10 0.04/0.14 * CEs [12] --> Loop 11 0.04/0.14 0.04/0.14 ### Ranking functions of CR f24(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 #### Partial ranking functions of CR f24(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 0.04/0.14 ### Specialization of cost equations f18/11 0.04/0.14 * CE 5 is refined into CE [14,15] 0.04/0.14 * CE 4 is discarded (unfeasible) 0.04/0.14 0.04/0.14 0.04/0.14 ### Cost equations --> "Loop" of f18/11 0.04/0.14 * CEs [15] --> Loop 12 0.04/0.14 * CEs [14] --> Loop 13 0.04/0.14 0.04/0.14 ### Ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 #### Partial ranking functions of CR f18(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 0.04/0.14 ### Specialization of cost equations f0/11 0.04/0.14 * CE 1 is refined into CE [16,17] 0.04/0.14 * CE 2 is refined into CE [18,19] 0.04/0.14 * CE 3 is refined into CE [20,21] 0.04/0.14 0.04/0.14 0.04/0.14 ### Cost equations --> "Loop" of f0/11 0.04/0.14 * CEs [17,19,21] --> Loop 14 0.04/0.14 * CEs [16,18,20] --> Loop 15 0.04/0.14 0.04/0.14 ### Ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 #### Partial ranking functions of CR f0(A,B,C,D,E,F,G,H,I,J,M) 0.04/0.14 0.04/0.14 0.04/0.14 Computing Bounds 0.04/0.14 ===================================== 0.04/0.14 0.04/0.14 #### Cost of chains of f31(M): 0.04/0.14 * Chain [[8]]...: 1*it(8)+0 0.04/0.14 with precondition: [M=2] 0.04/0.14 0.04/0.14 * Chain [[8],9]: 1*it(8)+0 0.04/0.14 with precondition: [M=2] 0.04/0.14 0.04/0.14 * Chain [9]: 0 0.04/0.14 with precondition: [M=2] 0.04/0.14 0.04/0.14 0.04/0.14 #### Cost of chains of f24(A,B,C,D,E,F,G,H,I,J,M): 0.04/0.14 * Chain [11]: 1*s(2)+0 0.04/0.14 with precondition: [A=0,E=C,0>=G,F>=G] 0.04/0.14 0.04/0.14 * Chain [10]...: 1*s(3)+0
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