0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 Maximum number of concurrent processes: 900 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 0.00/0.03 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.00/0.03 0.00/0.03 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.03 + + 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_M -> ¿functionCall(__VERIFIER_nondet_int), main_N -> ¿functionCall(__VERIFIER_nondet_int), main_a -> main_i, main_b -> main_j, main_c -> 0}> 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 (main_i + 1), main_j -> (main_j + 1), main_c -> (main_c + 1)}> 0.00/0.03 0.00/0.03 0}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.00/0.03 0.00/0.03 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.00/0.03 0.00/0.03 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0}> 0.00/0.03 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.03 varCall_1}> 0.00/0.03 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.03 varCall_2}> 0.00/0.03 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.03 varCall_3}> 0.00/0.03 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.03 varCall_4, main_a -> main_i, main_b -> main_j, main_c -> 0}> 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 0.00/0.03 (main_i + 1), main_j -> (main_j + 1), main_c -> (main_c + 1)}> 0.00/0.03 0.00/0.03 0}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 7, 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 + + 0.00/0.03 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.03 0.00/0.03 0.00/0.03 Function Return and Parameters Information [2 functions]: 0.00/0.03 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.00/0.03 __VERIFIER_nondet_int__func_return_ [function result] : int 0.00/0.03 function name: main [1 return + 0 parameters] demangled: main 0.00/0.03 main__func_return_ [function result] : int 0.00/0.03 0.00/0.03 0.00/0.03 AST Ident Scanner Information [9 idents]: 0.00/0.03 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.03 main | function | [integer, ()] | 0.00/0.03 a | local variable | integer | | 0.00/0.03 b | local variable | integer | | 0.00/0.03 c | local variable | integer | | 0.00/0.03 i | local variable | integer | | 0.00/0.03 j | local variable | integer | | 0.00/0.03 M | local variable | integer | | 0.00/0.03 N | local variable | integer | | 0.00/0.03 0.00/0.03 Main function: main 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 0.00/0.03 (main_c + 1), main_i -> (main_i + 1), main_j -> (main_j + 1)}> 0.00/0.03 (main_c + 1), main_i -> (main_i + 1), main_j -> (main_j + 1)}> 0.00/0.03 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef5, undef6, undef7, undef8, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef5, undef6, undef7, undef8, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 7, 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 1 + main_c, main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}> 0.00/0.03 1 + main_c, main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 main_c, main_i, main_j, main_M, main_N 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 ( 7 , 2 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.006944 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.001428s 0.00/0.04 Ranking function: -2 - 2*main_i + 2*main_M 0.00/0.04 New Graphs: 0.00/0.04 Transitions: 0.00/0.04 1 + main_c, main_i -> 1 + main_i, main_j -> 1 + main_j, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 main_c, main_i, main_j, main_M, main_N 0.00/0.04 Checking conditional termination of SCC {l2}... 0.00/0.04 0.00/0.04 LOG: CALL solveLinear 0.00/0.04 0.00/0.04 LOG: RETURN solveLinear - Elapsed time: 0.000775s 0.00/0.04 Ranking function: -1 - main_j + main_N 0.00/0.04 New Graphs: 0.00/0.04 Proving termination of subgraph 2 0.00/0.04 Analyzing SCC {l7}... 0.00/0.04 No cycles found. 0.00/0.04 0.00/0.04 Program Terminates 0.00/0.04 EOF