Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736032
details
property
value
status
complete
benchmark
Fibonacci.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
26.7657618523 seconds
cpu usage
52.474667459
max memory
6.21871104E8
stage attributes
key
value
output-size
20014
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_n -> ¿functionCall(__VERIFIER_nondet_int), main_i -> 0, main_j -> 1, main_t -> 0}> <l1, l2, true> <l2, l5, (main_j = main_n)> <l2, l3, not((main_j = main_n))> <l3, l4, true, seq{main_t -> (main_j + main_i), main_i -> main_j, main_j -> main_t}> <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, l7, true, seq{main__func_return_ -> 0}> <l7, l8, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}> <l8, l1, true, seq{main_n -> varCall_1, main_i -> 0, main_j -> 1, main_t -> 0}> <l1, l2, true> <l2, l5, (main_j = main_n)> <l2, l3, not((main_j = main_n))> <l3, l4, true, seq{main_t -> (main_j + main_i), main_i -> main_j, main_j -> main_t}> <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 [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 10, col: 9> main | function | [integer, ()] | <line: 5, col: 1> n | local variable | integer | <line: 6, col: 5> | <line: 10, col: 5> <line: 15, col: 17> i | local variable | integer | <line: 7, col: 5> | <line: 11, col: 5> <line: 16, col: 15> <line: 17, col: 9> j | local variable | integer | <line: 8, col: 5> | <line: 12, col: 5> <line: 15, col: 12> <line: 16, col: 13> <line: 17, col: 13> <line: 18, col: 9> t | local variable | integer | <line: 9, col: 5> | <line: 13, col: 5> <line: 16, col: 9> <line: 18, col: 13> Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (main_n = undef2) /\ (main_i = 0) /\ (main_j = 1)> <l2, l6, (main_j = main_n)> <l2, l2, (main_j < main_n), par{main_i -> main_j, main_j -> (main_j + main_i)}> <l2, l2, (main_j > main_n), par{main_i -> main_j, main_j -> (main_j + main_i)}>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257