/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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: 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_k -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int), main_m -> ¿functionCall(__VERIFIER_nondet_int), main_N -> ¿functionCall(__VERIFIER_nondet_int)}> 0}> 0}> (main_j + 1), main_k -> main_i}> (main_k + 1)}> main_k}> (main_i + 1)}> 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: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_5}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_6}> 0}> 0}> (main_j + 1), main_k -> main_i}> (main_k + 1)}> main_k}> (main_i + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 21, 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 [8 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | j | local variable | integer | | k | local variable | integer | | m | local variable | integer | | n | local variable | integer | | N | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0, main_j -> 0}> 0, main_j -> undef8}> undef7, main_j -> undef8}> undef7, main_j -> undef8}> undef7, main_j -> undef8}> (main_j + 1), main_k -> main_i}> (main_i + 1), main_j -> 0}> (main_i + 1)}> (main_k + 1)}> main_k}> Fresh variables: undef7, undef8, undef9, undef10, undef11, undef12, Undef variables: undef7, undef8, undef9, undef10, undef11, undef12, Abstraction variables: Exit nodes: 21, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_j, main_k -> main_i, rest remain the same}> 1 + main_i, main_j -> 0, rest remain the same}> 1 + main_k, rest remain the same}> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_m, main_n, main_N Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 0, main_j -> 0, rest remain the same}> Graph 2 0, main_j -> undef8, rest remain the same}> undef7, main_j -> undef8, rest remain the same}> undef7, main_j -> undef8, rest remain the same}> undef7, main_j -> undef8, rest remain the same}> 1 + main_i, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 9 , 1 ) ( 12 , 1 ) ( 21 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.023927 Checking conditional termination of SCC {l9, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003056s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011783s [2440 : 2441] [2440 : 2442] Successful child: 2441 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_k, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_k, rest remain the same}> Ranking function: -main_i + main_n New Graphs: Transitions: 1 + main_j, main_k -> main_i, rest remain the same}> 1 + main_k, rest remain the same}> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_m, main_N Checking conditional termination of SCC {l9, l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002791s Ranking function: -1 - main_j + main_m New Graphs: Transitions: 1 + main_k, rest remain the same}> Variables: main_i, main_k, main_N Checking conditional termination of SCC {l12}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001151s Ranking function: -1 - main_k + main_N New Graphs: INVARIANTS: 12: main_i <= main_k , Quasi-INVARIANTS to narrow Graph: 12: Proving termination of subgraph 2 Analyzing SCC {l21}... No cycles found. Program Terminates