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_y1 -> ¿functionCall(__VERIFIER_nondet_int), main_y2 -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> = 0)> = 0))> main_y2)> main_y2))> (main_y1 - main_y2)}> (main_y2 - main_y1)}> 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}> = 0)> = 0))> = 0)> = 0))> main_y2)> main_y2))> (main_y1 - main_y2)}> (main_y2 - main_y1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, 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, ()] | y1 | local variable | integer | | y2 | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (undef4 >= 0)> = 0) /\ not((undef4 >= 0))> = 0))> main_y2)), par{main_y2 -> (main_y2 - main_y1)}> main_y2) /\ (main_y1 > main_y2), par{main_y1 -> (main_y1 - main_y2)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 13 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003721 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000880s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003194s [37471 : 37473] [37471 : 37474] Successful child: 37473 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, rest remain the same}> Ranking function: main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000562s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001840s [37471 : 37478] [37471 : 37479] Successful child: 37478 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> Ranking function: main_y2 New Graphs: LOG: CALL check - Post:1 <= main_y2 - Process 1 * Exit transition: * Postcondition : 1 <= main_y2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000631s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000738s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 1 <= main_y2 , LOG: CALL check - Post:1 <= main_y1 - Process 2 * Exit transition: * Postcondition : 1 <= main_y1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000614s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000711s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 1 <= main_y1 , Narrowing transition: -main_y1 + main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001765s Ranking function: 1 - main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000985s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003986s [37471 : 37483] [37471 : 37484] Successful child: 37483 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000597s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001897s [37471 : 37488] [37471 : 37489] Successful child: 37488 [ 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_y1 + main_y2, 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_y1 + main_y2, rest remain the same}> New Graphs: LOG: CALL check - Post:main_y1 <= main_y2 - Process 3 * Exit transition: * Postcondition : main_y1 <= main_y2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000889s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001017s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: main_y1 <= main_y2 , LOG: CALL check - Post:main_y2 <= main_y1 - Process 4 * Exit transition: * Postcondition : main_y2 <= main_y1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000668s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000784s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: main_y2 <= main_y1 , Narrowing transition: -main_y1 + main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001816s Ranking function: 1 - main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000987s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003955s [37471 : 37493] [37471 : 37494] Successful child: 37493 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000593s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001865s [37471 : 37498] [37471 : 37499] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006789s Time used: 0.006504 [37471 : 37503] [37471 : 37507] Successful child: 37507 Program does NOT terminate