details

property	value
status	complete
benchmark	NO_01.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n114.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0680000782013 seconds
cpu usage	0.122165104
max memory	4.0128512E7

stage attributes

key	value
output-size	7169
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_c -> 864}> <l1, l2, (main_c <= 10)> <l1, l8, not((main_c <= 10))> <l2, l3, true, seq{main_i -> 0}> <l3, l4, true> <l4, l7, not((main_i < 100))> <l4, l5, (main_i < 100)> <l5, l6, true, seq{main_i -> (main_i + 1)}> <l6, l4, true> <l7, l29, true> <l8, l9, (main_c <= 50)> <l8, l15, not((main_c <= 50))> <l9, l10, true, seq{main_i -> 0}> <l10, l11, true> <l11, l14, not((main_i < 101))> <l11, l12, (main_i < 101)> <l12, l13, true, seq{main_i -> (main_i + 1)}> <l13, l11, true> <l14, l15, true> <l15, l16, (main_c <= 100)> <l15, l22, not((main_c <= 100))> <l16, l17, true, seq{main_i -> 0}> <l17, l18, true> <l18, l21, not((main_i < 102))> <l18, l19, (main_i < 102)> <l19, l20, true, seq{main_i -> (main_i + 1)}> <l20, l18, true> <l21, l28, true> <l22, l23, true, seq{main_i -> 0}> <l23, l24, true> <l24, l27, not((main_i < 103))> <l24, l25, (main_i < 103)> <l25, l26, true, seq{main_i -> (main_i + 0)}> <l26, l24, true> <l27, l28, true> <l28, l29, true> <l29, l30, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: <l0, l1, true, seq{main__func_return_ -> 0, main_c -> 864}> <l1, l2, (main_c <= 10)> <l1, l8, not((main_c <= 10))> <l2, l3, true, seq{main_i -> 0}> <l3, l4, true> <l4, l5, (main_i < 100)> <l4, l7, not((main_i < 100))> <l5, l6, true, seq{main_i -> (main_i + 1)}> <l6, l4, true> <l7, l29, true> <l8, l9, (main_c <= 50)> <l8, l15, not((main_c <= 50))> <l9, l10, true, seq{main_i -> 0}> <l10, l11, true> <l11, l12, (main_i < 101)> <l11, l14, not((main_i < 101))> <l12, l13, true, seq{main_i -> (main_i + 1)}> <l13, l11, true> <l14, l15, true> <l15, l16, (main_c <= 100)> popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to C Integ Progr 58257