NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)) /\ ((undef1 - 1) <= arg1) /\ ((undef2 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> = undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1)) /\ ((undef1 - 1) <= undef13) /\ ((undef2 - 3) <= undef13) /\ (undef13 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ ((undef5 - 1) <= undef13) /\ (undef13 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> = undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, arg2 -> undef8, rest remain the same}> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.009163 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002244s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012768s Trying to remove transition: undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015236s Time used: 0.014559 Trying to remove transition: undef7, arg2 -> undef8, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015539s Time used: 0.014699 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030758s Time used: 0.029786 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072053s Time used: 0.072041 LOG: SAT solveNonLinear - Elapsed time: 0.102811s Cost: 1; Total time: 0.101827 Failed at location 2: arg3 <= 0 Before Improving: Quasi-invariant at l2: arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009168s Remaining time after improvement: 0.99583 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg3 <= 0 [ 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: undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> New Graphs: Transitions: undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001100s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004363s Trying to remove transition: undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010778s Time used: 0.010489 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036731s Time used: 0.03618 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001792s Time used: 4.00062 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005707s Time used: 1.00084 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017752s Time used: 0.011845 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001533s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001669s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: undef7, arg2 -> undef8, rest remain the same}> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003324s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.106173s Time used: 0.10536 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.073833s Time used: 0.07382 LOG: SAT solveNonLinear - Elapsed time: 0.180006s Cost: 3; Total time: 0.17918 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.014495s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058343s Time used: 0.057563 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.106865s Time used: 0.106849 LOG: SAT solveNonLinear - Elapsed time: 0.165208s Cost: 1; Total time: 0.164412 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.014067s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l2: 2 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060132s Time used: 0.060018 LOG: SAT solveNonLinear - Elapsed time: 0.060132s Cost: 0; Total time: 0.060018 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.017259s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, 1 <= arg2, 0 <= arg3, Transition: Conditions: 1 <= arg1, 1 <= arg2, 0 <= arg3, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, Transition: undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, Transition: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, Transition: undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> Conditions: 0 <= arg3, 1 <= arg1, 1 <= arg2, OPEN EXITS: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> > Conditions are reachable! Program does NOT terminate