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_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)}> 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)}> 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)}> 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, 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.000821s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001817s [64326 : 64328] [64326 : 64329] Successful child: 64328 [ 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, 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, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 1 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000574s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000672s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + 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, 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.000777s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001961s [64326 : 64333] [64326 : 64334] Successful child: 64333 [ 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, 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, rest remain the same}> Ranking function: main_x New Graphs: [64326 : 64338] [64326 : 64339] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= main_z , main_x + main_y + main_z <= 1 , Narrowing transition: main_x + main_y, main_y -> main_y + 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, rest remain the same}> main_x + main_y, main_y -> main_y + 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.001131s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005929s [64326 : 64340] [64326 : 64341] Successful child: 64340 [ 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + 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.000712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002581s [64326 : 64345] [64326 : 64346] Successful child: 64345 [ 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, 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, rest remain the same}> Ranking function: main_x - main_z New Graphs: [64326 : 64350] [64326 : 64351] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , LOG: CALL check - Post:main_x <= 1 + main_z - Process 2 * Exit transition: * Postcondition : main_x <= 1 + main_z LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000960s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001086s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 + main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + 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, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + 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.001710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015278s [64326 : 64352] [64326 : 64353] Successful child: 64352 [ 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, 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, 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + 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.000727s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002731s [64326 : 64357] [64326 : 64358] Successful child: 64357 [ 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, 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, rest remain the same}> Ranking function: 2*main_x New Graphs: LOG: CALL check - Post:main_x + main_y + main_z <= 0 - Process 3 * Exit transition: * Postcondition : main_x + main_y + main_z <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000744s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000886s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y + main_z <= 0 , [64326 : 64362] [64326 : 64363] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_z , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_y, main_y -> main_y + 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, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + 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.001779s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014875s [64326 : 64364] [64326 : 64365] Successful child: 64364 [ 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, 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, 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + 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.001398s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007061s [64326 : 64369] [64326 : 64370] Successful child: 64369 [ 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + 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.000769s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002732s [64326 : 64374] [64326 : 64375] Successful child: 64374 [ 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, 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, rest remain the same}> Ranking function: main_x New Graphs: LOG: CALL check - Post:0 <= main_z - Process 4 * Exit transition: * Postcondition : 0 <= main_z LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000905s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001039s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_z , [64326 : 64379] [64326 : 64380] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 0 , [64326 : 64381] [64326 : 64382] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_y + main_z <= 0 , Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + 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.003204s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043719s [64326 : 64383] [64326 : 64384] Successful child: 64383 [ 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + main_z, rest remain the same}> main_x + main_y, main_y -> main_y + 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.002034s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013188s [64326 : 64388] [64326 : 64389] Successful child: 64388 [ 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, 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, 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, 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, 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, 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, rest remain the same}> New Graphs: Transitions: main_x + main_y, main_y -> main_y + 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.000856s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003051s [64326 : 64393] [64326 : 64394] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010893s Time used: 0.010367 [64326 : 64538] [64326 : 64542] Successful child: 64542 Program does NOT terminate