NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = arg2), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 2}> 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = arg2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 1}> = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (2 = undef14), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (1 = undef14), par{arg1 -> undef4, arg2 -> undef5}> = undef8) /\ (arg2 >= undef8) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 0) /\ (undef11 > 0), par{arg1 -> undef10, arg2 -> undef11}> Fresh variables: undef1, undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, 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, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef1, arg2 -> undef2, rest remain the same}> undef4, arg2 -> undef5, 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.004633 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001295s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006079s Trying to remove transition: undef10, arg2 -> undef11, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005316s Time used: 0.004973 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.005202s Time used: 0.004846 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012528s Time used: 0.012178 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001063s Time used: 4.00027 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005052s Time used: 1.00031 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012697s Time used: 0.007819 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef1, arg2 -> undef2, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef1, arg2 -> undef2, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001079s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001138s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: undef7, arg2 -> undef8, rest remain the same}> undef10, arg2 -> undef11, rest remain the same}> Variables: arg1, arg2 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001279s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021513s Time used: 0.021151 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091455s Time used: 0.091452 LOG: SAT solveNonLinear - Elapsed time: 0.112968s Cost: 1; Total time: 0.112603 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.020173s 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: 1 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, 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.017698s Time used: 0.017639 LOG: SAT solveNonLinear - Elapsed time: 0.017698s Cost: 0; Total time: 0.017639 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.007049s 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: 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, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, 1 <= arg2, Transition: Conditions: 1 <= arg1, 1 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef1, arg2 -> undef2, rest remain the same}> Conditions: 1 <= arg1, 1 <= arg2, Transition: undef4, arg2 -> undef5, rest remain the same}> Conditions: 1 <= arg1, 1 <= arg2, Transition: undef1, arg2 -> undef2, rest remain the same}> Conditions: 1 <= arg1, 1 <= arg2, Transition: undef4, arg2 -> undef5, rest remain the same}> Conditions: 1 <= arg1, 1 <= arg2, OPEN EXITS: undef1, arg2 -> undef2, rest remain the same}> undef4, arg2 -> undef5, rest remain the same}> undef1, arg2 -> undef2, rest remain the same}> undef4, arg2 -> undef5, rest remain the same}> > Conditions are reachable! Program does NOT terminate