Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Complexity_C_Integer 2019-03-21 04.38 pair #429989331
details
property
value
status
complete
benchmark
NonTerminationSimple7_false-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Adapted_from_Stroeder_15
run statistics
property
value
solver
CoFloCo 2018
configuration
C
runtime (wallclock)
0.221532 seconds
cpu usage
0.144728
user time
0.115767
system time
0.028961
max virtual memory
113176.0
max residence set size
10828.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/3,eval_foo_bb2_in/3] 0.04/0.11 1. non_recursive : [eval_foo_stop/1] 0.04/0.11 2. non_recursive : [eval_foo_bb3_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/3] 0.04/0.11 5. non_recursive : [eval_foo_start/3] 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/3 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/3 0.04/0.11 5. SCC is partially evaluated into eval_foo_start/3 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/3 0.04/0.11 * CE 6 is refined into CE [7] 0.04/0.11 * CE 5 is refined into CE [8] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb1_in/3 0.04/0.11 * CEs [8] --> Loop 7 0.04/0.11 * CEs [7] --> Loop 8 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb1_in(V_c,V__0,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb1_in(V_c,V__0,B) 0.04/0.11 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_bb0_in/3 0.04/0.11 * CE 3 is refined into CE [9] 0.04/0.11 * CE 2 is refined into CE [10] 0.04/0.11 * CE 4 is refined into CE [11,12] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_bb0_in/3 0.04/0.11 * CEs [12] --> Loop 9 0.04/0.11 * CEs [9] --> Loop 10 0.04/0.11 * CEs [10] --> Loop 11 0.04/0.11 * CEs [11] --> Loop 12 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_bb0_in(V_c,V_x,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_bb0_in(V_c,V_x,B) 0.04/0.11 0.04/0.11 0.04/0.11 ### Specialization of cost equations eval_foo_start/3 0.04/0.11 * CE 1 is refined into CE [13,14,15,16] 0.04/0.11 0.04/0.11 0.04/0.11 ### Cost equations --> "Loop" of eval_foo_start/3 0.04/0.11 * CEs [16] --> Loop 13 0.04/0.11 * CEs [15] --> Loop 14 0.04/0.11 * CEs [14] --> Loop 15 0.04/0.11 * CEs [13] --> Loop 16 0.04/0.11 0.04/0.11 ### Ranking functions of CR eval_foo_start(V_c,V_x,B) 0.04/0.11 0.04/0.11 #### Partial ranking functions of CR eval_foo_start(V_c,V_x,B) 0.04/0.11 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_c,V__0,B): 0.04/0.11 * Chain [[7]]...: 1*it(7)+0 0.04/0.11 with precondition: [V_c=0,V__0>=0,B=2] 0.04/0.11 0.04/0.11 * Chain [8]: 0 0.04/0.11 with precondition: [V_c=0,B=2,0>=V__0+1] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_bb0_in(V_c,V_x,B): 0.04/0.11 * Chain [12]: 0 0.04/0.11 with precondition: [V_c=0,0>=V_x+1] 0.04/0.11 0.04/0.11 * Chain [11]: 0 0.04/0.11 with precondition: [0>=V_c+1] 0.04/0.11 0.04/0.11 * Chain [10]: 0 0.04/0.11 with precondition: [V_c>=1] 0.04/0.11 0.04/0.11 * Chain [9]...: 1*s(1)+0 0.04/0.11 with precondition: [V_c=0,V_x>=0] 0.04/0.11 0.04/0.11 0.04/0.11 #### Cost of chains of eval_foo_start(V_c,V_x,B): 0.04/0.11 * Chain [16]: 0 0.04/0.11 with precondition: [V_c=0,0>=V_x+1] 0.04/0.11 0.04/0.11 * Chain [15]: 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