Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736842
details
property
value
status
complete
benchmark
genady_true-termination.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.0297698974609 seconds
cpu usage
0.025992211
max memory
4358144.0
stage attributes
key
value
output-size
4489
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_j -> 1, main_i -> 10000}> <l1, l2, true> <l2, l5, not(((main_i - main_j) >= 1))> <l2, l3, ((main_i - main_j) >= 1)> <l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i - 1)}> <l4, l2, true> <l5, l6, 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_j -> 1, main_i -> 10000}> <l1, l2, true> <l2, l3, ((main_i - main_j) >= 1)> <l2, l5, not(((main_i - main_j) >= 1))> <l3, l4, true, seq{main_j -> (main_j + 1), main_i -> (main_i - 1)}> <l4, l2, true> <l5, l6, true, seq{main__func_return_ -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | <line: 9, col: 1> main | function | [integer, ()] | <line: 11, col: 1> i | local variable | integer | <line: 12, col: 5> | <line: 14, col: 5> <line: 15, col: 12> <line: 17, col: 9> <line: 17, col: 13> j | local variable | integer | <line: 12, col: 5> | <line: 13, col: 5> <line: 15, col: 14> <line: 16, col: 9> <line: 16, col: 13> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_i = 10000) /\ (main_j = 1)> <l2, l2, ((main_i - main_j) >= 1), par{main_i -> (main_i - 1), main_j -> (main_j + 1)}> <l2, l6, not(((main_i - main_j) >= 1))> Fresh variables: Undef variables: Abstraction variables: Exit nodes:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257