Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989525
details
property
value
status
complete
benchmark
Urban-WST2013-Fig2_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.240818 seconds
cpu usage
0.164272
user time
0.136627
system time
0.027645
max virtual memory
113176.0
max residence set size
11268.0
stage attributes
key
value
starexec-result
WORST_CASE(?,O(n^1))
output
0.04/0.13 WORST_CASE(?,O(n^1)) 0.04/0.13 0.04/0.13 Preprocessing Cost Relations 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 #### Computed strongly connected components 0.04/0.13 0. recursive : [eval_foo_bb2_in/3,eval_foo_bb3_in/3] 0.04/0.13 1. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in_loop_cont/4,eval_foo_bb4_in/3] 0.04/0.13 2. non_recursive : [eval_foo_stop/1] 0.04/0.13 3. non_recursive : [eval_foo_bb5_in/1] 0.04/0.13 4. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.04/0.13 5. non_recursive : [eval_foo_bb0_in/2] 0.04/0.13 6. non_recursive : [eval_foo_start/3] 0.04/0.13 0.04/0.13 #### Obtained direct recursion through partial evaluation 0.04/0.13 0. SCC is partially evaluated into eval_foo_bb2_in/3 0.04/0.13 1. SCC is partially evaluated into eval_foo_bb1_in/2 0.04/0.13 2. SCC is completely evaluated into other SCCs 0.04/0.13 3. SCC is completely evaluated into other SCCs 0.04/0.13 4. SCC is completely evaluated into other SCCs 0.04/0.13 5. SCC is partially evaluated into eval_foo_bb0_in/2 0.04/0.13 6. SCC is partially evaluated into eval_foo_start/3 0.04/0.13 0.04/0.13 Control-Flow Refinement of Cost Relations 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_bb2_in/3 0.04/0.13 * CE 6 is refined into CE [7] 0.04/0.13 * CE 5 is refined into CE [8] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_bb2_in/3 0.04/0.13 * CEs [8] --> Loop 7 0.04/0.13 * CEs [7] --> Loop 8 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_bb2_in(V__01,B,C) 0.04/0.13 * RF of phase [7]: [V__01-1] 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_bb2_in(V__01,B,C) 0.04/0.13 * Partial RF of phase [7]: 0.04/0.13 - RF of loop [7:1]: 0.04/0.13 V__01-1 0.04/0.13 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_bb1_in/2 0.04/0.13 * CE 4 is refined into CE [9] 0.04/0.13 * CE 3 is refined into CE [10] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_bb1_in/2 0.04/0.13 * CEs [10] --> Loop 9 0.04/0.13 * CEs [9] --> Loop 10 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.13 * RF of phase [9]: [-V__0+11] 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.13 * Partial RF of phase [9]: 0.04/0.13 - RF of loop [9:1]: 0.04/0.13 -V__0+11 0.04/0.13 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_bb0_in/2 0.04/0.13 * CE 2 is refined into CE [11,12] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_bb0_in/2 0.04/0.13 * CEs [12] --> Loop 11 0.04/0.13 * CEs [11] --> Loop 12 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_bb0_in(V_x1,B) 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_bb0_in(V_x1,B) 0.04/0.13 0.04/0.13 0.04/0.13 ### Specialization of cost equations eval_foo_start/3 0.04/0.13 * CE 1 is refined into CE [13,14] 0.04/0.13 0.04/0.13 0.04/0.13 ### Cost equations --> "Loop" of eval_foo_start/3 0.04/0.13 * CEs [14] --> Loop 13 0.04/0.13 * CEs [13] --> Loop 14 0.04/0.13 0.04/0.13 ### Ranking functions of CR eval_foo_start(V_x1,V_x2,B) 0.04/0.13 0.04/0.13 #### Partial ranking functions of CR eval_foo_start(V_x1,V_x2,B) 0.04/0.13 0.04/0.13 0.04/0.13 Computing Bounds 0.04/0.13 ===================================== 0.04/0.13 0.04/0.13 #### Cost of chains of eval_foo_bb2_in(V__01,B,C): 0.04/0.13 * Chain [[7],8]: 1*it(7)+0 0.04/0.13 Such that:it(7) =< V__01 0.04/0.13 0.04/0.13 with precondition: [B=2,C=1,10>=V__01,V__01>=2] 0.04/0.13 0.04/0.13 0.04/0.13 #### Cost of chains of eval_foo_bb1_in(V__0,B): 0.04/0.13 * Chain [[9],10]: 1*it(9)+1*s(3)+0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Complexity_C_Integer 2019-03-21 04.38