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), main_w -> 5}> (main_i - 1), main_i -> (main_i * ~(1))}> main_w)> main_w))> (main_i + 1), main_i -> (main_i * ~(1))}> 0}> 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, main_w -> 5}> (main_i - 1), main_i -> (main_i * ~(1))}> main_w)> main_w))> (main_i + 1), main_i -> (main_i * ~(1))}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, 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, ()] | i | local variable | integer | | w | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: ((main_i - 1) * ~(1))}> 5)), par{main_i -> 0}> 0) /\ not((main_i < ~(5))) /\ (main_i > 5), par{main_i -> ((main_i + 1) * ~(1))}> 0) /\ not((main_i < ~(5))) /\ not((main_i > 5)), par{main_i -> 0}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 - main_i, rest remain the same}> 0, rest remain the same}> -1 - main_i, rest remain the same}> 0, 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 ) ( 14 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004657 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001264s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.088514s [19721 : 19723] [19721 : 19724] Successful child: 19723 [ 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: 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: 0, 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: 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > 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: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, rest remain the same}> New Graphs: [19721 : 19728] [19721 : 19729] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , 0 <= main_i , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 0, rest remain the same}> invGraph after Narrowing: Transitions: 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.000731s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008646s [19721 : 19730] [19721 : 19731] Successful child: 19730 [ 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: 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... > 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}> New Graphs: [19721 : 19735] [19721 : 19736] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_i , main_i <= 1 , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000729s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008688s [19721 : 19737] [19721 : 19738] Successful child: 19737 [ 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: 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: 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}> New Graphs: [19721 : 19742] [19721 : 19743] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 1 , 0 <= 1 + main_i , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008677s [19721 : 19744] [19721 : 19745] Successful child: 19744 [ 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: 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: 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}> New Graphs: [19721 : 19749] [19721 : 19750] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_i , main_i <= 5 , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000713s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008674s [19721 : 19751] [19721 : 19752] Successful child: 19751 [ 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: 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... > 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}> New Graphs: [19721 : 19756] [19721 : 19757] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i <= 0 , 0 <= 2 + main_i , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008628s [19721 : 19758] [19721 : 19759] Successful child: 19758 [ 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: 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: 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}> New Graphs: [19721 : 19763] [19721 : 19764] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 4 + main_i , main_i <= 3 , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000717s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008646s [19721 : 19765] [19721 : 19766] Successful child: 19765 [ 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: 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: 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}> New Graphs: [19721 : 19770] [19721 : 19771] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 5 + main_i , main_i <= 4 , Narrowing transition: 1 - main_i, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - main_i, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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.000730s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008634s [19721 : 19772] [19721 : 19773] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009311s Time used: 0.008919 [19721 : 19777] [19721 : 19781] Successful child: 19777 Program does NOT terminate