details

property	value
status	complete
benchmark	AliasDarteFeautrierGonnord-SAS2010-loops_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.160085916519 seconds
cpu usage	0.358776163
max memory	7.8987264E7

stage attributes

key	value
output-size	10040
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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_n -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_x -> main_n}> <l1, l2, (main_x >= 0)> <l1, l14, not((main_x >= 0))> <l2, l3, true> <l3, l13, not((main_x >= 0))> <l3, l4, (main_x >= 0)> <l4, l5, true, seq{main_y -> 1}> <l5, l6, (main_y < main_x)> <l5, l11, not((main_y < main_x))> <l6, l7, true> <l7, l10, not((main_y < main_x))> <l7, l8, (main_y < main_x)> <l8, l9, true, seq{main_y -> (2 * main_y)}> <l9, l7, true> <l10, l11, true> <l11, l12, true, seq{main_x -> (main_x - 1)}> <l12, l3, true> <l13, l14, true> <l14, l15, 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, l16, true, seq{main__func_return_ -> 0}> <l16, l17, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l17, l18, true, seq{main_n -> varCall_1}> <l18, l19, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l19, l1, true, seq{main_y -> varCall_2, main_x -> main_n}> <l1, l2, (main_x >= 0)> <l1, l14, not((main_x >= 0))> <l2, l3, true> <l3, l4, (main_x >= 0)> <l3, l13, not((main_x >= 0))> <l4, l5, true, seq{main_y -> 1}> <l5, l6, (main_y < main_x)> <l5, l11, not((main_y < main_x))> <l6, l7, true> <l7, l8, (main_y < main_x)> <l7, l10, not((main_y < main_x))> <l8, l9, true, seq{main_y -> (2 * main_y)}> <l9, l7, true> <l10, l11, true> <l11, l12, true, seq{main_x -> (main_x - 1)}> <l12, l3, true> <l13, l14, true> <l14, l15, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ popout

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

job log

popout

actions

all output return to C Integ Progr 58257