YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_i -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> = 1)> = 1))> 1}> ~(1)}> = 1)> = 1))> (main_x + main_t)}> (main_x - main_t)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> = 1)> = 1))> 1}> ~(1)}> = 1)> = 1))> (main_x + main_t)}> (main_x - main_t)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [7 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | x | local variable | integer | | n | local variable | integer | | b | local variable | integer | | t | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 1), par{main_t -> 1}> = 1)), par{main_t -> ~(1)}> = 1), par{main_x -> (main_x + main_t)}> = 1)), par{main_x -> (main_x - main_t)}> Fresh variables: undef5, undef6, undef7, undef8, Undef variables: undef5, undef6, undef7, undef8, Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_t, rest remain the same}> main_x - main_t, rest remain the same}> Variables: main_x, main_n, main_b, main_t Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 1, rest remain the same}> -1, rest remain the same}> Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 1 ) ( 15 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003977 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001216s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002535s [3025 : 3027] [3025 : 3028] Successful child: 3027 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_t, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x - main_t, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x - main_t, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_t, rest remain the same}> New Graphs: Transitions: main_x + main_t, rest remain the same}> Variables: main_x, main_n, main_b, main_t Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000456s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001205s [3025 : 3032] [3025 : 3033] Successful child: 3032 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_t, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_t, rest remain the same}> Ranking function: -main_x + main_n New Graphs: LOG: CALL check - Post:1 <= main_b - Process 1 * Exit transition: -1, rest remain the same}> * Postcondition : 1 <= main_b LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000410s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000466s INVARIANTS: 7: Quasi-INVARIANTS to narrow Graph: 7: 1 <= main_b , LOG: CALL check - Post:1 <= main_t - Process 2 * Exit transition: -1, rest remain the same}> * Postcondition : 1 <= main_t LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000313s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000358s INVARIANTS: 7: Quasi-INVARIANTS to narrow Graph: 7: 1 <= main_t , Narrowing transition: main_x + main_t, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x - main_t, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_t, rest remain the same}> main_x - main_t, rest remain the same}> Variables: main_x, main_n, main_b, main_t Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000935s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002492s [3025 : 3037] [3025 : 3038] Successful child: 3037 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_t, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x - main_t, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_t, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x - main_t, rest remain the same}> New Graphs: Transitions: main_x - main_t, rest remain the same}> Variables: main_x, main_n, main_b, main_t Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000583s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001530s [3025 : 3042] [3025 : 3043] Successful child: 3042 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x - main_t, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x - main_t, rest remain the same}> Ranking function: -main_x + main_n - main_t New Graphs: INVARIANTS: 7: main_b <= 0 , Quasi-INVARIANTS to narrow Graph: 7: INVARIANTS: 7: 1 + main_t <= 0 , Quasi-INVARIANTS to narrow Graph: 7: Proving termination of subgraph 2 Analyzing SCC {l15}... No cycles found. Program Terminates