Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736062
details
property
value
status
complete
benchmark
AliasDarteFeautrierGonnord-SAS2010-Fig2b_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n091.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.360332965851 seconds
cpu usage
0.680567798
max memory
1.73666304E8
stage attributes
key
value
output-size
12668
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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> <l1, l2, true> <l2, l17, not((main_x >= 2))> <l2, l3, (main_x >= 2)> <l3, l4, true, seq{main_x -> (main_x - 1), main_y -> (main_y + main_x)}> <l4, l5, true> <l5, l15, not((main_y >= (main_x + 1)))> <l5, l6, (main_y >= (main_x + 1))> <l6, l15, (¿functionCall(__VERIFIER_nondet_int) = 0)> <l6, l7, not((¿functionCall(__VERIFIER_nondet_int) = 0))> <l7, l8, true, seq{main_y -> (main_y - 1)}> <l8, l9, true> <l9, l13, not((main_y >= (main_x + 3)))> <l9, l10, (main_y >= (main_x + 3))> <l10, l13, (¿functionCall(__VERIFIER_nondet_int) = 0)> <l10, l11, not((¿functionCall(__VERIFIER_nondet_int) = 0))> <l11, l12, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 2)}> <l12, l9, true> <l13, l14, true, seq{main_y -> (main_y - 1)}> <l14, l5, true> <l15, l16, true, seq{main_x -> (main_x - 1), main_y -> (main_y - main_x)}> <l16, l2, true> <l17, l18, 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, l19, true, seq{main__func_return_ -> 0}> <l19, l20, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l20, l21, true, seq{main_x -> varCall_1}> <l21, l22, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}> <l22, l1, true, seq{main_y -> varCall_2}> <l1, l2, true> <l2, l3, (main_x >= 2)> <l2, l17, not((main_x >= 2))> <l3, l4, true, seq{main_x -> (main_x - 1), main_y -> (main_y + main_x)}> <l4, l5, true> <l5, l6, (main_y >= (main_x + 1))> <l5, l15, not((main_y >= (main_x + 1)))> <l6, l23, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}> <l23, l15, (varCall_3 = 0)> <l23, l7, (varCall_3 = 1)> <l7, l8, true, seq{main_y -> (main_y - 1)}> <l8, l9, true> <l9, l10, (main_y >= (main_x + 3))> <l9, l13, not((main_y >= (main_x + 3)))> <l10, l24, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}> <l24, l13, (varCall_4 = 0)> <l24, l11, (varCall_4 = 1)> <l11, l12, true, seq{main_x -> (main_x + 1), main_y -> (main_y - 2)}> <l12, l9, true> <l13, l14, true, seq{main_y -> (main_y - 1)}> <l14, l5, true> <l15, l16, true, seq{main_x -> (main_x - 1), main_y -> (main_y - main_x)}> <l16, l2, true> <l17, l18, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257