YES Solver Timeout: 4 Global Timeout: 60 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_n -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}> 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}> 0)> 0))> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | n | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_x < main_n), par{main_x -> ((~(main_x) + main_y) - 5), main_y -> (2 * main_y)}> 0) /\ not((main_x < main_n))> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002801 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000656s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002150s [12931 : 12933] [12931 : 12934] Successful child: 12933 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5 - main_x + main_y, main_y -> 2*main_y, 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): -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Ranking function: main_x - main_y New Graphs: LOG: CALL check - Post:main_y + main_n <= 2 - Process 1 * Exit transition: * Postcondition : main_y + main_n <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000600s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000712s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_y + main_n <= 2 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000732s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003601s [12931 : 12938] [12931 : 12939] Successful child: 12938 [ 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: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_n <= 0 - Process 2 * Exit transition: * Postcondition : main_n <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000545s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000673s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_n <= 0 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000817s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003530s [12931 : 12943] [12931 : 12944] Successful child: 12943 [ 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: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_n <= 1 - Process 3 * Exit transition: * Postcondition : main_n <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000603s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000720s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_n <= 1 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000809s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004276s [12931 : 12948] [12931 : 12949] Successful child: 12948 [ 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: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 4 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000666s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000785s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000816s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004222s [12931 : 12953] [12931 : 12954] Successful child: 12953 [ 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: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_n <= main_x - Process 5 * Exit transition: * Postcondition : main_n <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000721s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000858s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_n <= main_x , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000822s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004252s [12931 : 12958] [12931 : 12959] Successful child: 12958 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5 - main_x + main_y, main_y -> 2*main_y, 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): -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Ranking function: main_x - main_y + main_n New Graphs: LOG: CALL check - Post:main_x + main_y <= 4 - Process 6 * Exit transition: * Postcondition : main_x + main_y <= 4 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000673s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000820s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 4 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000877s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005861s [12931 : 12963] [12931 : 12964] Successful child: 12963 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5 - main_x + main_y, main_y -> 2*main_y, 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): -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Ranking function: main_x - main_y New Graphs: LOG: CALL check - Post:main_y <= 0 - Process 7 * Exit transition: * Postcondition : main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000658s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000822s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_y <= 0 , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001027s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004833s [12931 : 12968] [12931 : 12969] Successful child: 12968 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -5 - main_x + main_y, main_y -> 2*main_y, 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): -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Ranking function: -main_x + main_n New Graphs: LOG: CALL check - Post:5 + main_x + main_n <= main_y - Process 8 * Exit transition: * Postcondition : 5 + main_x + main_n <= main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000718s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000892s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 5 + main_x + main_n <= main_y , Narrowing transition: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -5 - main_x + main_y, main_y -> 2*main_y, rest remain the same}> Variables: main_x, main_y, main_n Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001588s Ranking function: (2 / 3) + (1 / 15)*main_x + (~(1) / 5)*main_y + (1 / 3)*main_n New Graphs: Proving termination of subgraph 2 Analyzing SCC {l7}... No cycles found. Program Terminates