Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer 2019-03-28 22.15 pair #432272094
details
property
value
status
complete
benchmark
NO_04.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
13.8263 seconds
cpu usage
16.0645
user time
15.2094
system time
0.855063
max virtual memory
2588024.0
max residence set size
79512.0
stage attributes
key
value
starexec-result
NO
output
15.87/13.82 NO 15.87/13.82 15.87/13.82 Solver Timeout: 4 15.87/13.82 Global Timeout: 300 15.87/13.82 Maximum number of concurrent processes: 900 15.87/13.82 ******************************************************************************************* 15.87/13.82 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 15.87/13.82 ******************************************************************************************* 15.87/13.82 15.87/13.82 15.87/13.82 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 15.87/13.82 15.87/13.82 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 15.87/13.82 + + 15.87/13.82 Init Location: 0 15.87/13.82 Transitions: 15.87/13.82 <l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}> 15.87/13.82 <l1, l2, true> 15.87/13.82 <l2, l25, not((main_i < 100))> 15.87/13.82 <l2, l3, (main_i < 100)> 15.87/13.82 <l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}> 15.87/13.82 <l4, l5, true> 15.87/13.82 <l5, l23, not((main_j < main_a))> 15.87/13.82 <l5, l6, (main_j < main_a)> 15.87/13.82 <l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}> 15.87/13.82 <l7, l8, true> 15.87/13.82 <l8, l21, not((main_k >= 0))> 15.87/13.82 <l8, l9, (main_k >= 0)> 15.87/13.82 <l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}> 15.87/13.82 <l10, l11, true> 15.87/13.82 <l11, l19, not((main_l < main_b))> 15.87/13.82 <l11, l12, (main_l < main_b)> 15.87/13.82 <l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}> 15.87/13.82 <l13, l14, true> 15.87/13.82 <l14, l17, not((main_m >= 0))> 15.87/13.82 <l14, l15, (main_m >= 0)> 15.87/13.82 <l15, l16, true, seq{main_m -> (main_m - 0)}> 15.87/13.82 <l16, l14, true> 15.87/13.82 <l17, l18, true, seq{main_l -> (main_l + 1)}> 15.87/13.82 <l18, l11, true> 15.87/13.82 <l19, l20, true, seq{main_k -> (main_k - 1)}> 15.87/13.82 <l20, l8, true> 15.87/13.82 <l21, l22, true, seq{main_j -> (main_j + 1)}> 15.87/13.82 <l22, l5, true> 15.87/13.82 <l23, l24, true, seq{main_i -> (main_i + 1)}> 15.87/13.82 <l24, l2, true> 15.87/13.82 <l25, l26, true, seq{main__func_return_ -> 0}> 15.87/13.82 15.87/13.82 Fresh variables: 15.87/13.82 15.87/13.82 Undef variables: 15.87/13.82 15.87/13.82 Abstraction variables: 15.87/13.82 15.87/13.82 Exit nodes: 15.87/13.82 15.87/13.82 Accepting locations: 15.87/13.82 15.87/13.82 Asserts: 15.87/13.82 15.87/13.82 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 15.87/13.82 15.87/13.82 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 15.87/13.82 15.87/13.82 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 15.87/13.82 15.87/13.82 Init Location: 0 15.87/13.82 Transitions: 15.87/13.82 <l0, l1, true, seq{main__func_return_ -> 0, main_i -> 0}> 15.87/13.82 <l1, l2, true> 15.87/13.82 <l2, l3, (main_i < 100)> 15.87/13.82 <l2, l25, not((main_i < 100))> 15.87/13.82 <l3, l4, true, seq{main_a -> (main_i + 2), main_j -> 0}> 15.87/13.82 <l4, l5, true> 15.87/13.82 <l5, l6, (main_j < main_a)> 15.87/13.82 <l5, l23, not((main_j < main_a))> 15.87/13.82 <l6, l7, true, seq{main_k -> ((main_i + main_j) + 3)}> 15.87/13.82 <l7, l8, true> 15.87/13.82 <l8, l9, (main_k >= 0)> 15.87/13.82 <l8, l21, not((main_k >= 0))> 15.87/13.82 <l9, l10, true, seq{main_b -> (((main_i + main_j) + main_k) + 4), main_l -> 0}> 15.87/13.82 <l10, l11, true> 15.87/13.82 <l11, l12, (main_l < main_b)> 15.87/13.82 <l11, l19, not((main_l < main_b))> 15.87/13.82 <l12, l13, true, seq{main_m -> ((((main_i + main_j) + main_k) + main_l) + 1000)}> 15.87/13.82 <l13, l14, true> 15.87/13.82 <l14, l15, (main_m >= 0)> 15.87/13.82 <l14, l17, not((main_m >= 0))> 15.87/13.82 <l15, l16, true, seq{main_m -> (main_m - 0)}> 15.87/13.82 <l16, l14, true> 15.87/13.82 <l17, l18, true, seq{main_l -> (main_l + 1)}> 15.87/13.82 <l18, l11, true> 15.87/13.82 <l19, l20, true, seq{main_k -> (main_k - 1)}> 15.87/13.82 <l20, l8, true> 15.87/13.82 <l21, l22, true, seq{main_j -> (main_j + 1)}> 15.87/13.82 <l22, l5, true> 15.87/13.82 <l23, l24, true, seq{main_i -> (main_i + 1)}> 15.87/13.82 <l24, l2, true> 15.87/13.82 <l25, l26, true, seq{main__func_return_ -> 0}> 15.87/13.82
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer 2019-03-28 22.15