NO 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)}> 0))> 0)> (main_x + main_y), main_y -> (main_y + 1)}> 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}> 0)> 0))> (main_x + main_y), main_y -> (main_y + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_x -> (main_x + main_y), main_y -> (main_y + 1)}> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001996 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000711s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001664s [57909 : 57911] [57909 : 57912] Successful child: 57911 [ 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_y, main_y -> 1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000477s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000564s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000696s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001783s [57909 : 57916] [57909 : 57917] Successful child: 57916 [ 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_y, main_y -> 1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 2 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000551s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000643s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000676s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001761s [57909 : 57921] [57909 : 57922] Successful child: 57921 [ 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_y, main_y -> 1 + 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): main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Ranking function: main_x New Graphs: LOG: CALL check - Post:main_x + main_y <= 0 - Process 3 * Exit transition: * Postcondition : main_x + main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000514s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000616s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 0 , Narrowing transition: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000578s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001986s [57909 : 57926] [57909 : 57927] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006884s Time used: 0.006471 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016307s Time used: 0.016302 LOG: SAT solveNonLinear - Elapsed time: 0.023191s Cost: 1; Total time: 0.022773 Quasi-ranking function: 50000 - main_y New Graphs: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002708s [57909 : 57934] [57909 : 57935] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008688s Time used: 0.00823 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014795s Time used: 0.01479 LOG: SAT solveNonLinear - Elapsed time: 0.023483s Cost: 1; Total time: 0.02302 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_x [ 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_y, main_y -> 1 + 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): main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - 2*main_x + 50001*main_y New Graphs: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000775s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006145s [57909 : 57942] [57909 : 57943] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010582s Time used: 0.010076 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019855s Time used: 0.019849 LOG: SAT solveNonLinear - Elapsed time: 0.030437s Cost: 1; Total time: 0.029925 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + main_x [ 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_y, main_y -> 1 + 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): main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000886s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004802s [57909 : 57951] [57909 : 57952] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009291s Time used: 0.008708 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017504s Time used: 0.017499 LOG: SAT solveNonLinear - Elapsed time: 0.026795s Cost: 1; Total time: 0.026207 Quasi-ranking function: 50000 - main_x - main_y New Graphs: Transitions: main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000744s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004205s [57909 : 57959] [57909 : 57960] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010627s Time used: 0.010158 [57909 : 57967] [57909 : 57971] Successful child: 57967 Program does NOT terminate