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_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> = 1))> = 1)> = 1))> = 1)> (2 * main_a), main_b -> (3 * main_b)}> 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}> = 1)> = 1))> = 1)> = 1))> (2 * main_a), main_b -> (3 * main_b)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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, ()] | a | local variable | integer | | b | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 1) /\ (main_b >= 1), par{main_a -> (2 * main_a), main_b -> (3 * main_b)}> = 1) /\ not((main_b >= 1))> = 1))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002132 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000612s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001780s [37499 : 37501] [37499 : 37502] Successful child: 37501 [ 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_a <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000489s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000581s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_a <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000600s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001935s [37499 : 37507] [37499 : 37508] Successful child: 37507 [ 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a + main_b <= 1 - Process 2 * Exit transition: * Postcondition : main_a + main_b <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000580s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000684s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_b <= 1 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000654s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002763s [37499 : 37513] [37499 : 37514] Successful child: 37513 [ 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: 2*main_a, main_b -> 3*main_b, 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_b <= 0 - Process 3 * Exit transition: * Postcondition : main_b <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000500s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000608s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000664s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002812s [37499 : 37519] [37499 : 37520] Successful child: 37519 [ 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: 2*main_a, main_b -> 3*main_b, 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: 2*main_a, main_b -> 3*main_b, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 0 - Process 4 * Exit transition: * Postcondition : main_a <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000558s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000673s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 0 , Narrowing transition: 2*main_a, main_b -> 3*main_b, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000651s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002784s [37499 : 37524] [37499 : 37525] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011089s Time used: 0.010616 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034769s Time used: 0.034762 LOG: SAT solveNonLinear - Elapsed time: 0.045858s Cost: 1; Total time: 0.045378 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_a + main_b [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - main_b New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000641s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003345s [37499 : 37595] [37499 : 37596] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010908s Time used: 0.010401 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037242s Time used: 0.037235 LOG: SAT solveNonLinear - Elapsed time: 0.048150s Cost: 1; Total time: 0.047636 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_a [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - main_a New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005633s [37499 : 37600] [37499 : 37601] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012449s Time used: 0.011889 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037515s Time used: 0.037509 LOG: SAT solveNonLinear - Elapsed time: 0.049964s Cost: 1; Total time: 0.049398 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_a + main_b [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_a, main_b -> 3*main_b, 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): 2*main_a, main_b -> 3*main_b, rest remain the same}> Quasi-ranking function: 50000 - 2*main_a - main_b New Graphs: Transitions: 2*main_a, main_b -> 3*main_b, rest remain the same}> Variables: main_a, main_b 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.007100s [37499 : 37605] [37499 : 37606] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015962s Time used: 0.015504 [37499 : 37610] [37499 : 37614] Successful child: 37610 Program does NOT terminate