0.00/0.13 NO 0.00/0.13 0.00/0.13 Solver Timeout: 4 0.00/0.13 Global Timeout: 300 0.00/0.13 Maximum number of concurrent processes: 900 0.00/0.13 ******************************************************************************************* 0.00/0.13 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 0.00/0.13 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.00/0.13 0.00/0.13 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.13 + + 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 (main_i + 1)}> 0.00/0.13 0.00/0.13 0.00/0.13 0}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.00/0.13 0.00/0.13 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.00/0.13 0.00/0.13 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.00/0.13 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 0}> 0.00/0.13 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.13 varCall_1}> 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 0.00/0.13 (main_i + 1)}> 0.00/0.13 0.00/0.13 0.00/0.13 0}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 8, 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 + + 0.00/0.13 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.13 0.00/0.13 0.00/0.13 Function Return and Parameters Information [2 functions]: 0.00/0.13 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.00/0.13 __VERIFIER_nondet_int__func_return_ [function result] : int 0.00/0.13 function name: main [1 return + 0 parameters] demangled: main 0.00/0.13 main__func_return_ [function result] : int 0.00/0.13 0.00/0.13 0.00/0.13 AST Ident Scanner Information [3 idents]: 0.00/0.13 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.13 main | function | [integer, ()] | 0.00/0.13 i | local variable | integer | | 0.00/0.13 0.00/0.13 Main function: main 0.00/0.13 Preprocessed LLVMGraph 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 0.00/0.13 0.00/0.13 (main_i + 1)}> 0.00/0.13 3), par{main_i -> (main_i + 1)}> 0.00/0.13 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef2, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef2, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 8, 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 ************************************************************* 0.00/0.13 ******************************************************************************************* 0.00/0.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Init Location: 0 0.00/0.13 Graph 0: 0.00/0.13 Transitions: 0.00/0.13 Variables: 0.00/0.13 0.00/0.13 Graph 1: 0.00/0.13 Transitions: 0.00/0.13 0.00/0.13 1 + main_i, rest remain the same}> 0.00/0.13 1 + main_i, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 main_i 0.00/0.13 0.00/0.13 Graph 2: 0.00/0.13 Transitions: 0.00/0.13 Variables: 0.00/0.13 0.00/0.13 Precedence: 0.00/0.13 Graph 0 0.00/0.13 0.00/0.13 Graph 1 0.00/0.13 0.00/0.13 0.00/0.13 Graph 2 0.00/0.13 0.00/0.13 0.00/0.13 Map Locations to Subgraph: 0.00/0.13 ( 0 , 0 ) 0.00/0.13 ( 2 , 1 ) 0.00/0.13 ( 8 , 2 ) 0.00/0.13 0.00/0.13 ******************************************************************************************* 0.00/0.13 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Proving termination of subgraph 0 0.00/0.13 Proving termination of subgraph 1 0.00/0.13 Checking unfeasibility... 0.00/0.13 Time used: 0.00319 0.00/0.13 0.00/0.13 Checking conditional termination of SCC {l2}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.000932s 0.00/0.13 Ranking function: 10 - 5*main_i 0.00/0.13 New Graphs: 0.00/0.13 Transitions: 0.00/0.13 0.00/0.13 1 + main_i, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 main_i 0.00/0.13 Checking conditional termination of SCC {l2}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.000566s 0.00/0.13 Ranking function: 9 - main_i 0.00/0.13 New Graphs: 0.00/0.13 Transitions: 0.00/0.13 0.00/0.13 Variables: 0.00/0.13 main_i 0.00/0.13 > No variable changes in termination graph. 0.00/0.13 Checking conditional unfeasibility... 0.00/0.13 Termination failed. Trying to show unreachability... 0.00/0.13 Proving unreachability of entry: 0.00/0.13 0.00/0.13 LOG: CALL check - Post:1 <= 0 - Process 1 0.00/0.13 * Exit transition: 0.00/0.13 * Postcondition : 1 <= 0 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.000290s 0.00/0.13 > Postcondition is not implied! 0.00/0.13 0.00/0.13 LOG: RETURN check - Elapsed time: 0.000366s 0.00/0.13 Cannot prove unreachability 0.00/0.13 0.00/0.13 [19197 : 19199] 0.00/0.13 [19197 : 19203] 0.00/0.13 Successful child: 19203 0.00/0.13 0.00/0.13 Program does NOT terminate 0.00/0.13 EOF