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)}> 0))> 0)> 0))> 0)> main_x, main_oldy -> main_y}> (main_oldx - 1), main_y -> main_oldx}> (main_oldy - 2), main_y -> (main_oldx + 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_oldy -> main_y}> ¿functionCall(__VERIFIER_nondet_int)}> (main_oldx - 1), main_y -> main_oldx}> (main_oldy - 2), main_y -> (main_oldx + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 12, 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 [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | oldx | local variable | integer | | oldy | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_y > 0) /\ (undef6 = 0), par{main_x -> (main_y - 2), main_y -> (main_x + 1)}> 0) /\ (main_y > 0) /\ (undef6 = 1), par{main_x -> (main_x - 1), main_y -> main_x}> 0) /\ not((main_y > 0))> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 12, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, 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 ) ( 12 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003872 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001171s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015317s [13109 : 13111] [13109 : 13112] Successful child: 13111 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, 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.000498s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000588s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001112s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015377s [13109 : 13116] [13109 : 13117] Successful child: 13116 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_y <= 0 - Process 2 * Exit transition: * Postcondition : main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000646s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000738s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_y <= 0 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001089s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015377s [13109 : 13121] [13109 : 13122] Successful child: 13121 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 3 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000657s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000789s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001077s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015509s [13109 : 13126] [13109 : 13127] Successful child: 13126 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> Ranking function: main_x + main_y New Graphs: Transitions: -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000992s Ranking function: -1 + main_x New Graphs: LOG: CALL check - Post:main_x + main_y <= 3 - Process 4 * Exit transition: * Postcondition : main_x + main_y <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000549s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000656s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= 3 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001231s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024258s [13109 : 13131] [13109 : 13132] Successful child: 13131 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> Ranking function: main_x + main_y New Graphs: LOG: CALL check - Post:2*main_x + main_y <= 6 - Process 5 * Exit transition: * Postcondition : 2*main_x + main_y <= 6 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000611s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000733s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2*main_x + main_y <= 6 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001518s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046336s [13109 : 13136] [13109 : 13137] Successful child: 13136 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> Ranking function: -10 + 3*main_x + 2*main_y New Graphs: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001489s Ranking function: -1 + main_x + main_y New Graphs: [13109 : 13147] [13109 : 13148] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 + main_y , main_x + main_y <= 6 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003218s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.334321s [13109 : 13149] [13109 : 13150] Successful child: 13149 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> New Graphs: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002553s Ranking function: (~(21) / 2) + (7 / 2)*main_x New Graphs: [13109 : 13154] [13109 : 13155] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2*main_x + main_y <= 7 , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_x, main_y -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003204s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.421869s [13109 : 13159] [13109 : 13160] Successful child: 13159 [ 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_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_x, main_y -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> New Graphs: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002995s Ranking function: -5 + main_x + main_y New Graphs: Transitions: -1 + main_x, main_y -> main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001557s Ranking function: -1 + main_x New Graphs: [13109 : 13164] [13109 : 13165] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 + main_y , main_y <= 4 + main_x , Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> It's unfeasible. Removing transition: -1 + main_x, main_y -> main_x, rest remain the same}> invGraph after Narrowing: Transitions: -2 + main_y, main_y -> 1 + main_x, rest remain the same}> -2 + main_y, main_y -> 1 + main_x, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002800s Ranking function: (~(9) / 2) + main_x + main_y New Graphs: Proving termination of subgraph 2 Analyzing SCC {l12}... No cycles found. Program Terminates