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), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> 0)> 0))> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_x -> (main_x + main_y), main_y -> (main_y + main_z), main_z -> (main_z - 1)}> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002413 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000562s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001619s [11846 : 11848] [11846 : 11849] Successful child: 11848 [ 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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.000563s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000667s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000511s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001760s [11846 : 11853] [11846 : 11854] Successful child: 11853 [ 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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.000648s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000753s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000508s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001757s [11846 : 11859] [11846 : 11860] Successful child: 11859 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Ranking function: 2*main_x - main_z New Graphs: [11846 : 11872] [11846 : 11873] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= main_z , main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001570s Ranking function: main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000634s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002386s [11846 : 11874] [11846 : 11875] Successful child: 11874 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Ranking function: 2 + main_x + main_y - main_z New Graphs: [11846 : 11917] [11846 : 11918] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x + main_y + main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001849s Ranking function: 1 + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000719s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003191s [11846 : 11919] [11846 : 11920] Successful child: 11919 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Ranking function: 2 + main_x + main_y + main_z New Graphs: [11846 : 11956] [11846 : 11957] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001967s Ranking function: -1 + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000758s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003109s [11846 : 11958] [11846 : 11959] Successful child: 11958 [ 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Ranking function: 2*main_x + 2*main_y + main_z New Graphs: [11846 : 11964] [11846 : 11965] [11846 : 11966] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_z <= 0 , main_y <= 2 + main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002981s Ranking function: -1 + main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002072s Ranking function: main_z New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000914s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004496s [11846 : 11967] [11846 : 11968] Successful child: 11967 [ 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, 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_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Ranking function: 2*main_y - 2*main_z New Graphs: [11846 : 12028] [11846 : 12029] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x , 3 + main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003279s Ranking function: 2 + main_z New Graphs: Proving termination of subgraph 2 Analyzing SCC {l6}... No cycles found. Program Terminates