0.00/0.08 YES 0.00/0.08 0.00/0.08 Solver Timeout: 4 0.00/0.08 Global Timeout: 300 0.00/0.08 Maximum number of concurrent processes: 900 0.00/0.08 ******************************************************************************************* 0.00/0.08 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 0.00/0.08 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 0.00/0.08 0.00/0.08 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.08 + + 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_M -> ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.08 0)> 0.00/0.08 0))> 0.00/0.08 0.00/0.08 0.00/0.08 0.00/0.08 main_M)> 0.00/0.08 main_M))> 0.00/0.08 0}> 0.00/0.08 0.00/0.08 (main_x + 1)}> 0.00/0.08 0.00/0.08 0.00/0.08 0.00/0.08 0}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 0.00/0.08 0.00/0.08 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 0.00/0.08 0.00/0.08 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 0.00/0.08 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 0}> 0.00/0.08 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.08 varCall_1}> 0.00/0.08 ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.08 varCall_2}> 0.00/0.08 0)> 0.00/0.08 0))> 0.00/0.08 0.00/0.08 0.00/0.08 0.00/0.08 main_M)> 0.00/0.08 main_M))> 0.00/0.08 0}> 0.00/0.08 0.00/0.08 (main_x + 1)}> 0.00/0.08 0.00/0.08 0.00/0.08 0.00/0.08 0}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 12, 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 + + 0.00/0.08 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 0.00/0.08 0.00/0.08 0.00/0.08 Function Return and Parameters Information [2 functions]: 0.00/0.08 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 0.00/0.08 __VERIFIER_nondet_int__func_return_ [function result] : int 0.00/0.08 function name: main [1 return + 0 parameters] demangled: main 0.00/0.08 main__func_return_ [function result] : int 0.00/0.08 0.00/0.08 0.00/0.08 AST Ident Scanner Information [4 idents]: 0.00/0.08 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.08 main | function | [integer, ()] | 0.00/0.08 x | local variable | integer | | 0.00/0.08 M | local variable | integer | | 0.00/0.08 0.00/0.08 Main function: main 0.00/0.08 Preprocessed LLVMGraph 0.00/0.08 Init Location: 0 0.00/0.08 Transitions: 0.00/0.08 0)> 0.00/0.08 0))> 0.00/0.08 0.00/0.08 main_M)), par{main_x -> (main_x + 1)}> 0.00/0.08 main_M) /\ (main_x > main_M), par{main_x -> 0}> 0.00/0.08 0.00/0.08 Fresh variables: 0.00/0.08 undef3, undef4, 0.00/0.08 0.00/0.08 Undef variables: 0.00/0.08 undef3, undef4, 0.00/0.08 0.00/0.08 Abstraction variables: 0.00/0.08 0.00/0.08 Exit nodes: 0.00/0.08 12, 0.00/0.08 Accepting locations: 0.00/0.08 0.00/0.08 Asserts: 0.00/0.08 0.00/0.08 ************************************************************* 0.00/0.08 ******************************************************************************************* 0.00/0.08 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Init Location: 0 0.00/0.08 Graph 0: 0.00/0.08 Transitions: 0.00/0.08 Variables: 0.00/0.08 0.00/0.08 Graph 1: 0.00/0.08 Transitions: 0.00/0.08 1 + main_x, rest remain the same}> 0.00/0.08 0, rest remain the same}> 0.00/0.08 Variables: 0.00/0.08 main_x, main_M 0.00/0.08 0.00/0.08 Graph 2: 0.00/0.08 Transitions: 0.00/0.08 Variables: 0.00/0.08 0.00/0.08 Precedence: 0.00/0.08 Graph 0 0.00/0.08 0.00/0.08 Graph 1 0.00/0.08 0.00/0.08 0.00/0.08 Graph 2 0.00/0.08 0.00/0.08 0.00/0.08 0.00/0.08 Map Locations to Subgraph: 0.00/0.08 ( 0 , 0 ) 0.00/0.08 ( 3 , 1 ) 0.00/0.08 ( 12 , 2 ) 0.00/0.08 0.00/0.08 ******************************************************************************************* 0.00/0.08 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.08 ******************************************************************************************* 0.00/0.08 0.00/0.08 Proving termination of subgraph 0 0.00/0.08 Proving termination of subgraph 1 0.00/0.08 Checking unfeasibility... 0.00/0.08 Time used: 0.003713 0.00/0.08 0.00/0.08 Checking conditional termination of SCC {l3}... 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.001195s 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.004551s 0.00/0.08 [9989 : 9991] 0.00/0.08 [9989 : 9992] 0.00/0.08 Successful child: 9992 0.00/0.08 Ranking function: -main_x + main_M 0.00/0.08 Ranking function and negation of Quasi-Invariant applied 0.00/0.08 New Graphs: 0.00/0.08 Transitions: 0.00/0.08 0, rest remain the same}> 0.00/0.08 Variables: 0.00/0.08 main_x, main_M 0.00/0.08 Checking conditional termination of SCC {l3}... 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.000664s 0.00/0.08 0.00/0.08 LOG: CALL solveLinear 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear - Elapsed time: 0.001681s 0.00/0.08 [9989 : 9996] 0.00/0.08 [9989 : 9997] 0.00/0.08 Successful child: 9996 0.00/0.08 [ Invariant Graph ] 0.00/0.08 Strengthening and disabling transitions... 0.00/0.08 0.00/0.08 LOG: CALL solverLinear in Graph for feasibility 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.08 Strengthening transition (result): 0.00/0.08 1 + main_x, rest remain the same}> 0.00/0.08 0.00/0.08 LOG: CALL solverLinear in Graph for feasibility 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.08 Strengthening transition (result): 0.00/0.08 0, rest remain the same}> 0.00/0.08 [ Termination Graph ] 0.00/0.08 Strengthening and disabling transitions... 0.00/0.08 0.00/0.08 LOG: CALL solverLinear in Graph for feasibility 0.00/0.08 0.00/0.08 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.08 Strengthening transition (result): 0.00/0.08 0, rest remain the same}> 0.00/0.08 Ranking function: main_x - main_M 0.00/0.08 New Graphs: 0.00/0.08 INVARIANTS: 0.00/0.08 3: 0 <= main_M , 0.00/0.08 Quasi-INVARIANTS to narrow Graph: 0.00/0.08 3: 0.00/0.08 Proving termination of subgraph 2 0.00/0.08 Analyzing SCC {l12}... 0.00/0.08 No cycles found. 0.00/0.08 0.00/0.08 Program Terminates 0.00/0.08 EOF