0.00/0.04 YES 0.00/0.04 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 0.00/0.04 = 1)> 0.00/0.04 = 1))> 0.00/0.04 0.00/0.04 = 0))> 0.00/0.04 = 0)> 0.00/0.04 ((main_x - (2 * main_y)) + 1)}> 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 = 1)> 0.00/0.04 = 1))> 0.00/0.04 0.00/0.04 = 0)> 0.00/0.04 = 0))> 0.00/0.04 ((main_x - (2 * main_y)) + 1)}> 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 8, 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 [4 idents]: 0.00/0.04 __VERIFIER_nondet_int | function | [integer, ()] | | 0.00/0.04 main | function | [integer, ()] | 0.00/0.04 x | local variable | integer | | 0.00/0.04 y | 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 = 1)> 0.00/0.05 = 1))> 0.00/0.05 = 0), par{main_x -> ((main_x - (2 * main_y)) + 1)}> 0.00/0.05 = 0))> 0.00/0.05 0.00/0.05 Fresh variables: 0.00/0.05 undef3, undef4, 0.00/0.05 0.00/0.05 Undef variables: 0.00/0.05 undef3, undef4, 0.00/0.05 0.00/0.05 Abstraction variables: 0.00/0.05 0.00/0.05 Exit nodes: 0.00/0.05 8, 0.00/0.05 Accepting locations: 0.00/0.05 0.00/0.05 Asserts: 0.00/0.05 0.00/0.05 ************************************************************* 0.00/0.05 ******************************************************************************************* 0.00/0.05 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Init Location: 0 0.00/0.05 Graph 0: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Graph 1: 0.00/0.05 Transitions: 0.00/0.05 1 + main_x - 2*main_y, rest remain the same}> 0.00/0.05 Variables: 0.00/0.05 main_x, main_y 0.00/0.05 0.00/0.05 Graph 2: 0.00/0.05 Transitions: 0.00/0.05 Variables: 0.00/0.05 0.00/0.05 Precedence: 0.00/0.05 Graph 0 0.00/0.05 0.00/0.05 Graph 1 0.00/0.05 0.00/0.05 0.00/0.05 Graph 2 0.00/0.05 0.00/0.05 0.00/0.05 0.00/0.05 Map Locations to Subgraph: 0.00/0.05 ( 0 , 0 ) 0.00/0.05 ( 3 , 1 ) 0.00/0.05 ( 8 , 2 ) 0.00/0.05 0.00/0.05 ******************************************************************************************* 0.00/0.05 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.05 ******************************************************************************************* 0.00/0.05 0.00/0.05 Proving termination of subgraph 0 0.00/0.05 Proving termination of subgraph 1 0.00/0.05 Checking unfeasibility... 0.00/0.05 Time used: 0.002306 0.00/0.05 0.00/0.05 Checking conditional termination of SCC {l3}... 0.00/0.05 0.00/0.05 LOG: CALL solveLinear 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear - Elapsed time: 0.000820s 0.00/0.05 0.00/0.05 LOG: CALL solveLinear 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear - Elapsed time: 0.001528s 0.00/0.05 [4468 : 4478] 0.00/0.05 [4468 : 4479] 0.00/0.05 Successful child: 4478 0.00/0.05 [ Invariant Graph ] 0.00/0.05 Strengthening and disabling transitions... 0.00/0.05 0.00/0.05 LOG: CALL solverLinear in Graph for feasibility 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.05 Strengthening transition (result): 0.00/0.05 1 + main_x - 2*main_y, rest remain the same}> 0.00/0.05 [ Termination Graph ] 0.00/0.05 Strengthening and disabling transitions... 0.00/0.05 0.00/0.05 LOG: CALL solverLinear in Graph for feasibility 0.00/0.05 0.00/0.05 LOG: RETURN solveLinear in Graph for feasibility 0.00/0.05 Strengthening transition (result): 0.00/0.05 1 + main_x - 2*main_y, rest remain the same}> 0.00/0.05 Ranking function: main_x 0.00/0.05 New Graphs: 0.00/0.05 INVARIANTS: 0.00/0.05 3: 1 <= main_y , 0.00/0.05 Quasi-INVARIANTS to narrow Graph: 0.00/0.05 3: 0.00/0.05 Proving termination of subgraph 2 0.00/0.05 Analyzing SCC {l8}... 0.00/0.05 No cycles found. 0.00/0.05 0.00/0.05 Program Terminates 0.00/0.05 EOF