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_am -> main_a, main_bm -> main_b}> main_bm)> main_bm))> (main_bm + main_b)}> (main_am + main_a)}> 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, main_am -> main_a, main_bm -> main_b}> main_bm)> main_bm))> (main_bm + main_b)}> (main_am + main_a)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: 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, ()] | a | local variable | integer | | b | local variable | integer | | am | local variable | integer | | bm | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_bm)), par{main_am -> (main_am + main_a)}> main_bm) /\ (main_am > main_bm), par{main_bm -> (main_bm + main_b)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005774 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003839s [30683 : 30685] [30683 : 30686] Successful child: 30685 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> Ranking function: 1 + main_a + main_b + main_am - main_bm New Graphs: Transitions: main_a + main_am, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002904s [30683 : 30690] [30683 : 30691] Successful child: 30690 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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: main_a + main_am, rest remain the same}> New Graphs: [30683 : 30695] [30683 : 30696] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , main_am <= main_a + main_b + main_bm , LOG: CALL check - Post:main_b <= main_a - Process 1 * Exit transition: * Postcondition : main_b <= main_a LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000788s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000900s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_bm <= main_b + main_am , main_b <= main_a , Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004114s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.057394s [30683 : 30697] [30683 : 30698] Successful child: 30697 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003212s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.054581s [30683 : 30702] [30683 : 30703] Successful child: 30702 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002203s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020184s Piecewise ranking function: min(0,2*main_a - 2*main_b - 2*main_am + 2*main_bm) New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001551s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007697s [30683 : 30707] [30683 : 30708] Successful child: 30707 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000936s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003703s [30683 : 30712] [30683 : 30713] Successful child: 30712 [ 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_b + main_bm, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 0 - Process 2 * Exit transition: * Postcondition : main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001122s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001216s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , [30683 : 30717] [30683 : 30718] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= main_a , INVARIANTS: 2: main_a + main_bm <= main_b + main_am , Quasi-INVARIANTS to narrow Graph: 2: [30683 : 30719] [30683 : 30720] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_am <= main_bm , Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> Narrowing transition: main_a + main_am, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> Narrowing transition: main_b + main_bm, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_a + main_am, rest remain the same}> main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_am, main_bm, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003606s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.051394s [30683 : 30721] [30683 : 30722] Successful child: 30721 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_a + main_am, rest remain the same}> main_b + main_bm, rest remain the same}> main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002297s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015624s [30683 : 30866] [30683 : 30867] Successful child: 30866 [ 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_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, 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: main_a + main_am, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_b + main_bm, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_b + main_bm, rest remain the same}> New Graphs: Transitions: main_b + main_bm, rest remain the same}> Variables: main_a, main_b, main_am, main_bm Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000949s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003720s [30683 : 30871] [30683 : 30872] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012456s Time used: 0.011796 [30683 : 30877] [30683 : 30881] Successful child: 30877 Program does NOT terminate