0.00/0.26 YES 0.00/0.26 0.00/0.26 Solver Timeout: 4 0.00/0.26 Global Timeout: 300 0.00/0.26 Maximum number of concurrent processes: 900 0.00/0.26 ******************************************************************************************* 0.00/0.26 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.00/0.26 ******************************************************************************************* 0.00/0.26 0.00/0.26 0.00/0.26 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.00/0.26 0.00/0.26 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.26 + + 0.00/0.26 Init Location: 0 0.00/0.26 Transitions: 0.00/0.26 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.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 (main_j + 1), main_k -> main_i}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 (main_k + 1)}> 0.00/0.26 0.00/0.26 main_k}> 0.00/0.26 0.00/0.26 (main_i + 1)}> 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 Fresh variables: 0.00/0.26 0.00/0.26 Undef variables: 0.00/0.26 0.00/0.26 Abstraction variables: 0.00/0.26 0.00/0.26 Exit nodes: 0.00/0.26 0.00/0.26 Accepting locations: 0.00/0.26 0.00/0.26 Asserts: 0.00/0.26 0.00/0.26 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.00/0.26 0.00/0.26 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.00/0.26 0.00/0.26 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.00/0.26 0.00/0.26 Init Location: 0 0.00/0.26 Transitions: 0.00/0.26 0}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_1}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_2}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_3}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_4}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_5}> 0.00/0.26 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.26 varCall_6}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 (main_j + 1), main_k -> main_i}> 0.00/0.26 0.00/0.26 0.00/0.26 0.00/0.26 (main_k + 1)}> 0.00/0.26 0.00/0.26 main_k}> 0.00/0.26 0.00/0.26 (main_i + 1)}> 0.00/0.26 0.00/0.26 0.00/0.26 0}> 0.00/0.26 0.00/0.26 Fresh variables: 0.00/0.26 0.00/0.26 Undef variables: 0.00/0.26 0.00/0.26 Abstraction variables: 0.00/0.26 0.00/0.26 Exit nodes: 0.00/0.26 21, 0.00/0.26 Accepting locations: 0.00/0.26 0.00/0.26 Asserts: 0.00/0.26 0.00/0.26 + + 0.00/0.26 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.26 0.00/0.26 0.00/0.26 Function Return and Parameters Information [2 functions]: 0.00/0.26 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.00/0.26 __VERIFIER_nondet_int__func_return_ [function result] : int 0.00/0.26 function name: main [1 return + 0 parameters] demangled: main 0.00/0.26 main__func_return_ [function result] : int 0.00/0.26 0.00/0.26 0.00/0.26 AST Ident Scanner Information [8 idents]: 0.00/0.26 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.26 main | function | [integer, ()] | 0.00/0.26 i | local variable | integer | | 0.00/0.26 j | local variable | integer | | 0.00/0.26 k | local variable | integer | | 0.00/0.26 m | local variable | integer | | 0.00/0.26 n | local variable | integer | | 0.00/0.26 N | local variable | integer | | 0.00/0.26 0.00/0.26 Main function: main 0.00/0.26 Preprocessed LLVMGraph 0.00/0.26 Init Location: 0 0.00/0.26 Transitions: 0.00/0.26 0, main_j -> 0}> 0.00/0.26 0, main_j -> undef8}> 0.00/0.26 undef7, main_j -> undef8}> 0.00/0.26 undef7, main_j -> undef8}> 0.00/0.26 undef7, main_j -> undef8}> 0.00/0.26 (main_j + 1), main_k -> main_i}> 0.00/0.26 (main_i + 1), main_j -> 0}> 0.00/0.26 (main_i + 1)}> 0.00/0.26 (main_k + 1)}> 0.00/0.26 main_k}> 0.00/0.26 0.00/0.26 Fresh variables: 0.00/0.26 undef7, undef8, undef9, undef10, undef11, undef12, 0.00/0.26 0.00/0.26 Undef variables: 0.00/0.26 undef7, undef8, undef9, undef10, undef11, undef12, 0.00/0.26 0.00/0.26 Abstraction variables: 0.00/0.26 0.00/0.26 Exit nodes: 0.00/0.26 21, 0.00/0.26 Accepting locations: 0.00/0.26 0.00/0.26 Asserts: 0.00/0.26 0.00/0.26 ************************************************************* 0.00/0.26 ******************************************************************************************* 0.00/0.26 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.26 ******************************************************************************************* 0.00/0.26 0.00/0.26 Init Location: 0 0.00/0.26 Graph 0: 0.00/0.26 Transitions: 0.00/0.26 Variables: 0.00/0.26 0.00/0.26 Graph 1: 0.00/0.26 Transitions: 0.00/0.26 1 + main_j, main_k -> main_i, rest remain the same}> 0.00/0.26 1 + main_i, main_j -> 0, rest remain the same}> 0.00/0.26 1 + main_k, rest remain the same}> 0.00/0.26 main_k, rest remain the same}> 0.00/0.26 Variables: 0.00/0.26 main_i, main_j, main_k, main_m, main_n, main_N 0.00/0.26 0.00/0.26 Graph 2: 0.00/0.26 Transitions: 0.00/0.26 Variables: 0.00/0.26 0.00/0.26 Precedence: 0.00/0.26 Graph 0 0.00/0.26 0.00/0.26 Graph 1 0.00/0.26 0, main_j -> 0, rest remain the same}> 0.00/0.26 0.00/0.26 Graph 2 0.00/0.26 0, main_j -> undef8, rest remain the same}> 0.00/0.26 undef7, main_j -> undef8, rest remain the same}> 0.00/0.26 undef7, main_j -> undef8, rest remain the same}> 0.00/0.26 undef7, main_j -> undef8, rest remain the same}> 0.00/0.26 1 + main_i, rest remain the same}> 0.00/0.26 0.00/0.26 Map Locations to Subgraph: 0.00/0.26 ( 0 , 0 ) 0.00/0.26 ( 9 , 1 ) 0.00/0.26 ( 12 , 1 ) 0.00/0.26 ( 21 , 2 ) 0.00/0.26 0.00/0.26 ******************************************************************************************* 0.00/0.26 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.26 ******************************************************************************************* 0.00/0.26 0.00/0.26 Proving termination of subgraph 0 0.00/0.26 Proving termination of subgraph 1 0.00/0.26 Checking unfeasibility... 0.00/0.26 Time used: 0.026581 0.00/0.26 0.00/0.26 Checking conditional termination of SCC {l9, l12}... 0.00/0.26 0.00/0.26 LOG: CALL solveLinear 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear - Elapsed time: 0.003374s 0.00/0.26 0.00/0.26 LOG: CALL solveLinear 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear - Elapsed time: 0.012395s 0.00/0.26 [47469 : 47471] 0.00/0.26 [47469 : 47472] 0.00/0.26 Successful child: 47471 0.00/0.26 [ Invariant Graph ] 0.00/0.26 Strengthening and disabling transitions... 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 Strengthening transition (result): 0.00/0.26 1 + main_k, rest remain the same}> 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 Strengthening transition (result): 0.00/0.26 main_k, rest remain the same}> 0.00/0.26 [ Termination Graph ] 0.00/0.26 Strengthening and disabling transitions... 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 Strengthening transition (result): 0.00/0.26 1 + main_k, rest remain the same}> 0.00/0.26 0.00/0.26 LOG: CALL solverLinear in Graph for feasibility 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.26 Strengthening transition (result): 0.00/0.26 main_k, rest remain the same}> 0.00/0.26 Ranking function: -main_i + main_n 0.00/0.26 New Graphs: 0.00/0.26 Transitions: 0.00/0.26 1 + main_j, main_k -> main_i, rest remain the same}> 0.00/0.26 1 + main_k, rest remain the same}> 0.00/0.26 main_k, rest remain the same}> 0.00/0.26 Variables: 0.00/0.26 main_i, main_j, main_k, main_m, main_N 0.00/0.26 Checking conditional termination of SCC {l9, l12}... 0.00/0.26 0.00/0.26 LOG: CALL solveLinear 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear - Elapsed time: 0.002832s 0.00/0.26 Ranking function: -1 - main_j + main_m 0.00/0.26 New Graphs: 0.00/0.26 Transitions: 0.00/0.26 1 + main_k, rest remain the same}> 0.00/0.26 Variables: 0.00/0.26 main_i, main_k, main_N 0.00/0.26 Checking conditional termination of SCC {l12}... 0.00/0.26 0.00/0.26 LOG: CALL solveLinear 0.00/0.26 0.00/0.26 LOG: RETURN solveLinear - Elapsed time: 0.001157s 0.00/0.26 Ranking function: -1 - main_k + main_N 0.00/0.26 New Graphs: 0.00/0.26 INVARIANTS: 0.00/0.26 12: main_i <= main_k , 0.00/0.26 Quasi-INVARIANTS to narrow Graph: 0.00/0.26 12: 0.00/0.26 Proving termination of subgraph 2 0.00/0.26 Analyzing SCC {l21}... 0.00/0.26 No cycles found. 0.00/0.26 0.00/0.26 Program Terminates 0.00/0.26 EOF