NO 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 0)> 0))> 0))> 0)> ((main_x + 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))> 0)> 0))> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 8, 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)> 0))> 0), par{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 8, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*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 ) ( 3 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002274 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000349s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001009s [18961 : 18963] [18961 : 18964] Successful child: 18963 [ 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: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*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.000237s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000283s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + main_x <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000278s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000928s [18961 : 18968] [18961 : 18969] Successful child: 18968 [ 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: 2*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 It's unfeasible. Removing transition: 2*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.000231s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000275s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: main_x <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000240s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000812s [18961 : 18973] [18961 : 18974] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004553s Time used: 0.004372 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012766s Time used: 0.012764 LOG: SAT solveNonLinear - Elapsed time: 0.017320s Cost: 1; Total time: 0.017136 Quasi-ranking function: 50000 + main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000273s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001083s [18961 : 18978] [18961 : 18979] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017686s Time used: 0.016987 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016537s Time used: 0.016534 LOG: SAT solveNonLinear - Elapsed time: 0.034223s Cost: 1; Total time: 0.033521 Termination implied by a set of invariant(s): Invariant at l3: 1 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000434s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001687s [18961 : 18983] [18961 : 18984] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005522s Time used: 0.005261 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009989s Time used: 0.009988 LOG: SAT solveNonLinear - Elapsed time: 0.015511s Cost: 1; Total time: 0.015249 Termination implied by a set of invariant(s): Invariant at l3: 0 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - 2*main_x - main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000372s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001477s [18961 : 19156] [18961 : 19157] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018898s Time used: 0.018042 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.024616s Time used: 0.024614 LOG: SAT solveNonLinear - Elapsed time: 0.043515s Cost: 1; Total time: 0.042656 Termination implied by a set of invariant(s): Invariant at l3: 1 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x + main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001882s [18961 : 19162] [18961 : 19163] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006704s Time used: 0.006455 [18961 : 19167] [18961 : 19171] Successful child: 19167 Program does NOT terminate