Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989123
details
property
value
status
complete
benchmark
Choose.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n157.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.220358 seconds
cpu usage
0.144342
user time
0.113869
system time
0.030473
max virtual memory
113176.0
max residence set size
10900.0
stage attributes
key
value
starexec-result
MAYBE
output
0.04/0.11 MAYBE 0.04/0.11 0.04/0.11 Preprocessing Cost Relations 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 #### Computed strongly connected components 0.04/0.11 0. recursive : [eval_foo_bb1_in/2,eval_foo_bb2_in/2,eval_foo_bb3_in/2,eval_foo_bb4_in/2] 0.04/0.11 1. non_recursive : [eval_foo_stop/1] 0.04/0.11 2. non_recursive : [eval_foo_bb5_in/1] 0.04/0.11 3. non_recursive : [eval_foo_bb1_in_loop_cont/2] 0.04/0.11 4. non_recursive : [eval_foo_bb0_in/1] 0.04/0.11 5. non_recursive : [eval_foo_start/2] 0.04/0.11 0.04/0.11 #### Obtained direct recursion through partial evaluation 0.04/0.11 0. SCC is partially evaluated into eval_foo_bb1_in/2 0.04/0.11 1. SCC is completely evaluated into other SCCs 0.04/0.11 2. SCC is completely evaluated into other SCCs 0.04/0.11 3. SCC is completely evaluated into other SCCs 0.04/0.11 4. SCC is partially evaluated into eval_foo_bb0_in/1 0.04/0.11 5. SCC is partially evaluated into eval_foo_start/2 0.04/0.11 0.04/0.11 Control-Flow Refinement of Cost Relations 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_bb1_in/2 0.04/0.11 * CE 5 is discarded (unfeasible) 0.04/0.11 * CE 4 is refined into CE [6] 0.04/0.11 * CE 3 is refined into CE [7] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb1_in/2 0.04/0.11 * CEs [6] --> Loop 6 0.04/0.11 * CEs [7] --> Loop 7 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.11 * RF of phase [6]: [-V__0+6] 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb1_in(V__0,B) 0.04/0.11 * Partial RF of phase [6]: 0.04/0.11 - RF of loop [6:1]: 0.04/0.11 -V__0+6 0.04/0.11 0.04/0.11 Warning: no base case found for predicate 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_bb0_in/1 0.04/0.11 * CE 2 is refined into CE [8] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb0_in/1 0.04/0.11 * CEs [8] --> Loop 8 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb0_in(B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb0_in(B) 0.04/0.11 0.04/0.11 Warning: no base case found for predicate 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_start/2 0.04/0.11 * CE 1 is refined into CE [9] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_start/2 0.04/0.11 * CEs [9] --> Loop 9 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_start(V_i,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_start(V_i,B) 0.04/0.11 0.04/0.11 Warning: no base case found for predicate 0.04/0.11 0.04/0.11 Computing Bounds 0.04/0.11 ===================================== 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_bb1_in(V__0,B): 0.04/0.11 * Chain [[6],[7]]...: 1*it(6)+1*it(7)+0 0.04/0.11 Such that:it(6) =< -V__0+6 0.04/0.11 0.04/0.11 with precondition: [B=2,5>=V__0,V__0>=3] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_bb0_in(B): 0.04/0.11 * Chain [8]...: 1*s(1)+1*s(2)+0 0.04/0.11 Such that:s(1) =< 3 0.04/0.11 0.04/0.11 with precondition: [] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_start(V_i,B): 0.04/0.11 * Chain [9]...: 1*s(3)+1*s(4)+0 0.04/0.11 Such that:s(3) =< 3 0.04/0.11 0.04/0.11 with precondition: [] 0.04/0.11 0.04/0.11 0.04/0.11 Closed-form bounds of eval_foo_start(V_i,B): 0.04/0.11 ------------------------------------- 0.04/0.11 * Chain [9]... with precondition: [] 0.04/0.11 - Upper bound: inf 0.04/0.11 - Complexity: infinity 0.04/0.11
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