Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989375
details
property
value
status
complete
benchmark
Piecewise_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n001.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.280104 seconds
cpu usage
0.205939
user time
0.179691
system time
0.026248
max virtual memory
113176.0
max residence set size
11316.0
stage attributes
key
value
starexec-result
MAYBE
output
0.05/0.17 MAYBE 0.05/0.17 0.05/0.17 Preprocessing Cost Relations 0.05/0.17 ===================================== 0.05/0.17 0.05/0.17 #### Computed strongly connected components 0.05/0.17 0. recursive : [eval_foo_1/4,eval_foo_2/5,eval_foo_4/4,eval_foo_5/5,eval_foo_bb1_in/3,eval_foo_bb2_in/3,eval_foo_bb3_in/3,eval_foo_bb4_in/3,eval_foo_bb5_in/3] 0.05/0.17 1. non_recursive : [eval_foo_stop/1] 0.05/0.17 2. non_recursive : [eval_foo__critedge_in/1] 0.05/0.17 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.05/0.17 4. non_recursive : [eval_foo_bb0_in/3] 0.05/0.17 5. non_recursive : [eval_foo_start/3] 0.05/0.17 0.05/0.17 #### Obtained direct recursion through partial evaluation 0.05/0.17 0. SCC is partially evaluated into eval_foo_bb1_in/3 0.05/0.17 1. SCC is completely evaluated into other SCCs 0.05/0.17 2. SCC is completely evaluated into other SCCs 0.05/0.17 3. SCC is completely evaluated into other SCCs 0.05/0.17 4. SCC is partially evaluated into eval_foo_bb0_in/3 0.05/0.17 5. SCC is partially evaluated into eval_foo_start/3 0.05/0.17 0.05/0.17 Control-Flow Refinement of Cost Relations 0.05/0.17 ===================================== 0.05/0.17 0.05/0.17 ### Specialization of cost equations eval_foo_bb1_in/3 0.05/0.17 * CE 6 is refined into CE [8] 0.05/0.17 * CE 5 is refined into CE [9] 0.05/0.17 * CE 7 is refined into CE [10] 0.05/0.17 * CE 4 is refined into CE [11] 0.05/0.17 * CE 3 is refined into CE [12] 0.05/0.17 0.05/0.17 0.05/0.17 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 0.05/0.17 * CEs [11] --> Loop 8 0.05/0.17 * CEs [12] --> Loop 9 0.05/0.17 * CEs [8] --> Loop 10 0.05/0.17 * CEs [9] --> Loop 11 0.05/0.17 * CEs [10] --> Loop 12 0.05/0.17 0.05/0.17 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.05/0.17 0.05/0.17 #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) 0.05/0.17 * Partial RF of phase [8,9]: 0.05/0.17 - RF of loop [8:1]: 0.05/0.17 V__0 depends on loops [9:1] 0.05/0.17 - RF of loop [9:1]: 0.05/0.17 V__01 depends on loops [8:1] 0.05/0.17 0.05/0.17 0.05/0.17 ### Specialization of cost equations eval_foo_bb0_in/3 0.05/0.17 * CE 2 is refined into CE [13,14,15,16,17] 0.05/0.17 0.05/0.17 0.05/0.17 ### Cost equations --> "Loop" of eval_foo_bb0_in/3 0.05/0.17 * CEs [17] --> Loop 13 0.05/0.17 * CEs [16] --> Loop 14 0.05/0.17 * CEs [14] --> Loop 15 0.05/0.17 * CEs [15] --> Loop 16 0.05/0.17 * CEs [13] --> Loop 17 0.05/0.17 0.05/0.17 ### Ranking functions of CR eval_foo_bb0_in(V_p,V_q,B) 0.05/0.17 0.05/0.17 #### Partial ranking functions of CR eval_foo_bb0_in(V_p,V_q,B) 0.05/0.17 0.05/0.17 0.05/0.17 ### Specialization of cost equations eval_foo_start/3 0.05/0.17 * CE 1 is refined into CE [18,19,20,21,22] 0.05/0.17 0.05/0.17 0.05/0.17 ### Cost equations --> "Loop" of eval_foo_start/3 0.05/0.17 * CEs [22] --> Loop 18 0.05/0.17 * CEs [21] --> Loop 19 0.05/0.17 * CEs [20] --> Loop 20 0.05/0.17 * CEs [19] --> Loop 21 0.05/0.17 * CEs [18] --> Loop 22 0.05/0.17 0.05/0.17 ### Ranking functions of CR eval_foo_start(V_p,V_q,B) 0.05/0.17 0.05/0.17 #### Partial ranking functions of CR eval_foo_start(V_p,V_q,B) 0.05/0.17 0.05/0.17 0.05/0.17 Computing Bounds 0.05/0.17 ===================================== 0.05/0.17 0.05/0.17 #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): 0.05/0.17 * Chain [[8,9]]...: 2*it(8)+0 0.05/0.17 with precondition: [V__0+V__01>=3,V__0>=1,V__01>=1,B=2] 0.05/0.17 0.05/0.17 * Chain [[8,9],12]: 2*it(8)+0 0.05/0.17 with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 0.05/0.17 0.05/0.17 * Chain [[8,9],11]: 2*it(8)+0 0.05/0.17 with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 0.05/0.17 0.05/0.17 * Chain [[8,9],10]: 2*it(8)+0 0.05/0.17 with precondition: [B=2,V__01>=1,V__0>=1,V__0+V__01>=3] 0.05/0.17 0.05/0.17 * Chain [12]: 0 0.05/0.17 with precondition: [B=2,V__0=V__01] 0.05/0.17
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