Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381746065
details
property
value
status
complete
benchmark
aaron3_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.349267959595 seconds
cpu usage
0.270207308
max memory
8818688.0
stage attributes
key
value
output-size
4331
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_2/5,eval_foo_3/6,eval_foo_5/7,eval_foo_6/8,eval_foo_bb1_in/5,eval_foo_bb2_in/5,eval_foo_bb3_in/6,eval_foo_bb4_in/6] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo__critedge_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/5] 5. non_recursive : [eval_foo_start/5] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/5 1. SCC is completely evaluated into other SCCs 2. SCC is completely evaluated into other SCCs 3. SCC is completely evaluated into other SCCs 4. SCC is partially evaluated into eval_foo_bb0_in/5 5. SCC is partially evaluated into eval_foo_start/5 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/5 * CE 6 is refined into CE [7] * CE 5 is refined into CE [8] * CE 3 is refined into CE [9] * CE 4 is refined into CE [10] ### Cost equations --> "Loop" of eval_foo_bb1_in/5 * CEs [9] --> Loop 7 * CEs [10] --> Loop 8 * CEs [7] --> Loop 9 * CEs [8] --> Loop 10 ### Ranking functions of CR eval_foo_bb1_in(V__05,V__03,V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__05,V__03,V__01,V__0,B) * Partial RF of phase [7,8]: - RF of loop [8:1]: -V__01+V__0+1 depends on loops [7:1] V__05+V__03-V__01+1 depends on loops [7:1] ### Specialization of cost equations eval_foo_bb0_in/5 * CE 2 is refined into CE [11,12,13,14] ### Cost equations --> "Loop" of eval_foo_bb0_in/5 * CEs [14] --> Loop 11 * CEs [13] --> Loop 12 * CEs [11] --> Loop 13 * CEs [12] --> Loop 14 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,V_tx,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,V_z,V_tx,B) ### Specialization of cost equations eval_foo_start/5 * CE 1 is refined into CE [15,16,17,18] ### Cost equations --> "Loop" of eval_foo_start/5 * CEs [18] --> Loop 15 * CEs [17] --> Loop 16 * CEs [16] --> Loop 17 * CEs [15] --> Loop 18 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_z,V_tx,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_z,V_tx,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__05,V__03,V__01,V__0,B): * Chain [[7,8]]...: 2*it(7)+0 with precondition: [V__03+V__05>=V__0,V__0>=V__01,B=2] * Chain [[7,8],10]: 2*it(7)+0 with precondition: [B=2,V__0>=V__01,V__03+V__05>=V__0] * Chain [[7,8],9]: 2*it(7)+0 with precondition: [B=2,V__0>=V__01,V__03+V__05>=V__0] * Chain [10]: 0 with precondition: [B=2,V__01>=V__0+1] * Chain [9]: 0 with precondition: [B=2,V__0>=V__03+V__05+1]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445