/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: 0, main_k -> ¿functionCall(__VERIFIER_nondet_int), main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}> = 1)> = 1))> 0}> 0}> (main_j + 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}> = 1)> = 1))> 0}> 0}> (main_j + main_k)}> (main_i + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, 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, ()] | | main | function | [integer, ()] | k | local variable | integer | | i | local variable | integer | | j | local variable | integer | | n | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 1) /\ (0 < undef8), par{main_i -> 0, main_j -> 0}> = 1) /\ not((0 < undef8)), par{main_i -> 0, main_j -> undef7}> = 1)), par{main_i -> undef6, main_j -> undef7}> (main_j + main_k)}> (main_i + 1), main_j -> 0}> (main_i + 1)}> Fresh variables: undef5, undef6, undef7, undef8, Undef variables: undef5, undef6, undef7, undef8, Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_k + main_j, rest remain the same}> 1 + main_i, main_j -> 0, rest remain the same}> Variables: main_k, main_i, main_j, main_n Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 0, main_j -> 0, rest remain the same}> Graph 2 0, main_j -> undef7, rest remain the same}> undef6, main_j -> undef7, rest remain the same}> 1 + main_i, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 1 ) ( 14 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007978 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001737s Ranking function: -1 - 2*main_i + 2*main_n New Graphs: Transitions: main_k + main_j, rest remain the same}> Variables: main_k, main_i, main_j Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000776s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001831s [39052 : 39064] [39052 : 39066] Successful child: 39064 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_k + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_k + main_j, rest remain the same}> Ranking function: main_i - main_j New Graphs: INVARIANTS: 7: 1 <= main_k , Quasi-INVARIANTS to narrow Graph: 7: Proving termination of subgraph 2 Analyzing SCC {l14}... No cycles found. Program Terminates