0.00/0.03 YES 0.00/0.03 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 Maximum number of concurrent processes: 900 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 0.00/0.04 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.00/0.04 0.00/0.04 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.04 + + 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_m -> ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.04 0))> 0.00/0.04 0)> 0.00/0.04 main_m)> 0.00/0.04 main_m))> 0.00/0.04 0, main_j -> 0}> 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 (main_j + 1)}> 0.00/0.04 0.00/0.04 0, main_i -> (main_i + 1)}> 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.00/0.04 0.00/0.04 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.00/0.04 0.00/0.04 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0}> 0.00/0.04 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.04 varCall_1}> 0.00/0.04 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.04 varCall_2}> 0.00/0.04 0)> 0.00/0.04 0))> 0.00/0.04 main_m)> 0.00/0.04 main_m))> 0.00/0.04 0, main_j -> 0}> 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 (main_j + 1)}> 0.00/0.04 0.00/0.04 0, main_i -> (main_i + 1)}> 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 14, 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 + + 0.00/0.04 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.04 0.00/0.04 0.00/0.04 Function Return and Parameters Information [2 functions]: 0.00/0.04 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.00/0.04 __VERIFIER_nondet_int__func_return_ [function result] : int 0.00/0.04 function name: main [1 return + 0 parameters] demangled: main 0.00/0.04 main__func_return_ [function result] : int 0.00/0.04 0.00/0.04 0.00/0.04 AST Ident Scanner Information [6 idents]: 0.00/0.04 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.04 main | function | [integer, ()] | 0.00/0.04 i | local variable | integer | | 0.00/0.04 j | local variable | integer | | 0.00/0.04 m | local variable | integer | | 0.00/0.04 n | local variable | integer | | 0.00/0.04 0.00/0.04 Main function: main 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 0) /\ (undef3 > undef4), par{main_i -> 0, main_j -> 0}> 0.00/0.04 0) /\ not((undef3 > undef4))> 0.00/0.04 0))> 0.00/0.04 (main_j + 1)}> 0.00/0.04 (main_i + 1), main_j -> 0}> 0.00/0.04 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef3, undef4, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef3, undef4, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 14, 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 1 + main_j, rest remain the same}> 0.00/0.04 1 + main_i, main_j -> 0, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 main_i, main_j, main_m, main_n 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 0, main_j -> 0, rest remain the same}> 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 5 , 1 ) 0.00/0.04 ( 14 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.007821 0.00/0.04 0.00/0.04 Checking conditional termination of SCC {l5}... 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.001440s 0.00/0.04 Ranking function: -1 - main_i + main_n 0.00/0.04 New Graphs: 0.00/0.04 Transitions: 0.00/0.04 1 + main_j, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 main_i, main_j, main_m, main_n 0.00/0.04 Checking conditional termination of SCC {l5}... 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.000712s 0.00/0.04 Ranking function: -1 - main_j + main_m 0.00/0.04 New Graphs: 0.00/0.04 Proving termination of subgraph 2 0.00/0.04 Analyzing SCC {l14}... 0.00/0.04 No cycles found. 0.00/0.04 0.00/0.04 Program Terminates 0.00/0.04 EOF