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_i -> ¿functionCall(__VERIFIER_nondet_int)}> 10))> 10)> 30}> (main_i - 1)}> 20}> 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}> 10)> 10))> 30}> (main_i - 1)}> 20}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, 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 [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 10) /\ (main_i = 25) /\ (30 <= 30), par{main_i -> (30 - 1)}> 10) /\ (main_i < 25) /\ (main_i <= 30), par{main_i -> (main_i - 1)}> 10) /\ (main_i > 25) /\ (main_i <= 30), par{main_i -> (main_i - 1)}> 10) /\ (main_i > 25) /\ not((main_i <= 30)), par{main_i -> 20}> 10))> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> 20, rest remain the same}> Variables: main_i Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 13 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005452 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001374s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010329s Piecewise ranking function: min(-682 + 62*main_i,806) New Graphs: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i 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.010104s [37956 : 37958] [37956 : 37959] Successful child: 37958 [ 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: 29, 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_i, 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_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 20, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 6 - Process 1 * Exit transition: * Postcondition : main_i <= 6 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000500s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000581s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 6 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 20, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> 20, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001291s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010904s Piecewise ranking function: min(-682 + 62*main_i,806) New Graphs: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000681s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010124s [37956 : 37963] [37956 : 37964] Successful child: 37963 [ 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: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 20, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 18 - Process 2 * Exit transition: * Postcondition : main_i <= 18 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000473s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000560s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 18 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 20, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> 20, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001294s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012005s Piecewise ranking function: min(-1026 + 54*main_i,270) New Graphs: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000694s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010146s [37956 : 37968] [37956 : 37969] Successful child: 37968 [ 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: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 20, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 21 - Process 3 * Exit transition: * Postcondition : main_i <= 21 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000484s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000570s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 21 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 20, rest remain the same}> invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000978s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022324s Piecewise ranking function: min(62,-682 + 31*main_i) New Graphs: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000699s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010083s [37956 : 37973] [37956 : 37974] Successful child: 37973 [ 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: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_i, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 22 - Process 4 * Exit transition: * Postcondition : main_i <= 22 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000506s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000594s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 22 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001012s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019253s Piecewise ranking function: min(54,-621 + 27*main_i) New Graphs: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000702s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010183s [37956 : 37978] [37956 : 37979] Successful child: 37978 [ 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: 29, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_i, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 23 - Process 5 * Exit transition: * Postcondition : main_i <= 23 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000514s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000601s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 23 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + main_i, rest remain the same}> Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000757s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010274s [37956 : 37983] [37956 : 37984] Successful child: 37983 [ 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: 29, 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_i, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 24 - Process 6 * Exit transition: * Postcondition : main_i <= 24 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000633s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000728s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 24 , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000768s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010282s [37956 : 37988] [37956 : 37989] Successful child: 37988 [ 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: 29, 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_i, 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: 29, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:31 <= main_i - Process 7 * Exit transition: * Postcondition : 31 <= main_i LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000665s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000761s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 31 <= main_i , Narrowing transition: 29, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 29, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000766s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010330s [37956 : 37993] [37956 : 37994] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101950s Time used: 4.10143 [37956 : 37999] [37956 : 38003] Successful child: 37999 Program does NOT terminate