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)}> = ~(10000)))> = ~(10000))> = 1))> = 1)> (main_x - 1)}> (main_x + 1), main_z -> (main_z - 1)}> (main_x + main_y)}> 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}> = ~(10000))> = ~(10000)))> = 1)> = 1))> (main_x - 1)}> (main_x + 1), main_z -> (main_z - 1)}> (main_x + main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 16, 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: = ~(10000)) /\ (undef5 <= 10000) /\ (undef6 <= 10000) /\ (undef5 >= 1), par{main_x -> (undef4 - 1)}> = ~(10000)) /\ (undef5 <= 10000) /\ (undef6 <= 10000) /\ not((undef5 >= 1)), par{main_x -> undef4}> = ~(10000)) /\ (undef5 <= 10000) /\ not((undef6 <= 10000)), par{main_x -> undef4}> = ~(10000)) /\ not((undef5 <= 10000)), par{main_x -> undef4}> = ~(10000))), par{main_x -> undef4}> undef4}> (main_x + 1), main_z -> (main_z - 1)}> = 1), par{main_x -> (main_x - 1), main_y -> (main_x + main_y)}> = 1)), par{main_y -> (main_x + main_y)}> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 16, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 -1 + undef4, rest remain the same}> Graph 2 undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> undef4, rest remain the same}> main_x + main_y, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 9 , 1 ) ( 16 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005656 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001308s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006093s [33470 : 33472] [33470 : 33473] Successful child: 33472 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, 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): -1 + main_x, main_y -> main_x + main_y, 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): 1 + main_x, 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): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Ranking function: main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000758s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002872s [33470 : 33477] [33470 : 33478] Successful child: 33477 [ 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_x, 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: -1 + main_x, main_y -> main_x + main_y, 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_x, main_y -> main_x + main_y, rest remain the same}> New Graphs: INVARIANTS: 9: 1 <= main_y , Quasi-INVARIANTS to narrow Graph: 9: [33470 : 33482] [33470 : 33483] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x + main_y <= 0 , main_z <= 2 + main_x , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002641s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000706s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002932s [33470 : 33484] [33470 : 33485] Successful child: 33484 [ 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_x, 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: 1 + main_x, 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): -1 + main_x, main_y -> main_x + main_y, 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): -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Ranking function: main_x + 2*main_y New Graphs: [33470 : 33489] [33470 : 33490] [33470 : 33491] INVARIANTS: 9: Quasi-INVARIANTS to narrow Graph: 9: main_x <= 0 , main_z <= 1 , Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> 1 + main_x, main_z -> -1 + main_z, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004942s Ranking function: -6 + 3*main_z New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001963s Ranking function: -1 + main_x New Graphs: Transitions: -1 + main_x, main_y -> main_x + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001173s Ranking function: -1 + main_x + main_y New Graphs: Proving termination of subgraph 2 Analyzing SCC {l16}... No cycles found. Program Terminates