Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745924
details
property
value
status
complete
benchmark
svcomp_b.04.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.209019899368 seconds
cpu usage
0.12200197
max memory
8204288.0
stage attributes
key
value
output-size
2975
starexec-result
WORST_CASE(?,O(1))
output
/export/starexec/sandbox/solver/bin/starexec_run_C /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) Preprocessing Cost Relations ===================================== #### Computed strongly connected components 0. recursive : [eval_foo_bb1_in/3] 1. non_recursive : [eval_foo_stop/1] 2. non_recursive : [eval_foo_bb2_in/1] 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 4. non_recursive : [eval_foo_bb0_in/3] 5. non_recursive : [eval_foo_start/4] #### Obtained direct recursion through partial evaluation 0. SCC is partially evaluated into eval_foo_bb1_in/3 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/3 5. SCC is partially evaluated into eval_foo_start/4 Control-Flow Refinement of Cost Relations ===================================== ### Specialization of cost equations eval_foo_bb1_in/3 * CE 4 is refined into CE [5] * CE 3 is refined into CE [6] ### Cost equations --> "Loop" of eval_foo_bb1_in/3 * CEs [6] --> Loop 5 * CEs [5] --> Loop 6 ### Ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) #### Partial ranking functions of CR eval_foo_bb1_in(V__01,V__0,B) ### Specialization of cost equations eval_foo_bb0_in/3 * CE 2 is refined into CE [7,8] ### Cost equations --> "Loop" of eval_foo_bb0_in/3 * CEs [7] --> Loop 7 * CEs [8] --> Loop 8 ### Ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) #### Partial ranking functions of CR eval_foo_bb0_in(V_x,V_y,B) ### Specialization of cost equations eval_foo_start/4 * CE 1 is refined into CE [9,10] ### Cost equations --> "Loop" of eval_foo_start/4 * CEs [10] --> Loop 9 * CEs [9] --> Loop 10 ### Ranking functions of CR eval_foo_start(V_x,V_y,V_tmp,B) #### Partial ranking functions of CR eval_foo_start(V_x,V_y,V_tmp,B) Computing Bounds ===================================== #### Cost of chains of eval_foo_bb1_in(V__01,V__0,B): * Chain [6]: 0 with precondition: [B=2,V__01>=V__0] * Chain [5,6]: 1 with precondition: [B=2,V__0>=V__01+1] #### Cost of chains of eval_foo_bb0_in(V_x,V_y,B): * Chain [8]: 0 with precondition: [V_y>=V_x] * Chain [7]: 1 with precondition: [V_x>=V_y+1] #### Cost of chains of eval_foo_start(V_x,V_y,V_tmp,B): * Chain [10]: 0 with precondition: [V_y>=V_x] * Chain [9]: 1 with precondition: [V_x>=V_y+1] Closed-form bounds of eval_foo_start(V_x,V_y,V_tmp,B): ------------------------------------- * Chain [10] with precondition: [V_y>=V_x]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445