NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2, arg3 -> undef3}> arg1, arg3 -> arg1}> (arg1 + 1), arg2 -> undef8, arg3 -> undef9}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1)) /\ (undef14 < 10)> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1)}> Fresh variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Undef variables: undef2, undef3, undef8, undef9, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00459 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000933s Ranking function: 8 - arg1 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000338s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001154s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004447s Time used: 0.004329 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000399s Time used: 4.00018 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008564s Time used: 4.00004 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011706s Time used: 1.00001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009295s Time used: 0.006214 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000313s Time used: 1.0003 LOG: SAT solveNonLinear - Elapsed time: 1.009608s Cost: 1; Total time: 1.00651 Termination implied by a set of invariant(s): Invariant at l3: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000308s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001125s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003833s Time used: 0.003756 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000740s Time used: 4.00056 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002962s Time used: 4.00073 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004100s Time used: 1.00006 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011171s Time used: 0.006925 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000375s Time used: 1.00036 LOG: SAT solveNonLinear - Elapsed time: 1.011546s Cost: 1; Total time: 1.00729 Termination implied by a set of invariant(s): Invariant at l3: arg2 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000353s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001282s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004053s Time used: 0.003968 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004107s Time used: 4.00392 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004292s Time used: 4.00064 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005048s Time used: 1.0001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013007s Time used: 0.008349 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000812s Time used: 1.00074 LOG: SAT solveNonLinear - Elapsed time: 1.013819s Cost: 1; Total time: 1.00909 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + arg1 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg2 - 2*arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000445s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001847s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004501s Time used: 0.00439 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001648s Time used: 4.00133 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005482s Time used: 4.0006 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004624s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013862s Time used: 0.009067 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000779s Time used: 1.00077 LOG: SAT solveNonLinear - Elapsed time: 1.014641s Cost: 1; Total time: 1.00984 Termination implied by a set of invariant(s): Invariant at l3: arg2 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - 2*arg2 + arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000499s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002008s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004777s Time used: 0.004667 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001879s Time used: 4.00157 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003570s Time used: 4.00094 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003686s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014596s Time used: 0.009911 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000806s Time used: 1.00079 LOG: SAT solveNonLinear - Elapsed time: 1.015402s Cost: 1; Total time: 1.0107 Termination implied by a set of invariant(s): Invariant at l3: 0 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 - arg3 New Graphs: Transitions: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg2, arg3 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000530s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002129s Trying to remove transition: 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005016s Time used: 0.004904 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001858s Time used: 4.00155 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003532s Time used: 4.00107 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004230s Time used: 1.00004 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006655s Time used: 4.00209 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005391s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005450s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085494s Time used: 0.085179 Improving Solution with cost 7 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.105792s Time used: 0.105789 LOG: SAT solveNonLinear - Elapsed time: 0.191286s Cost: 7; Total time: 0.190968 Failed at location 3: 1 <= arg2 Before Improving: Quasi-invariant at l3: 1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009386s Remaining time after improvement: 0.997747 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l3: 13 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): 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 It's unfeasible. Removing transition: 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016540s Time used: 0.016381 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013666s Time used: 0.013663 LOG: SAT solveNonLinear - Elapsed time: 0.030206s Cost: 2; Total time: 0.030044 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg2 <= arg3 Strengthening and disabling EXIT transitions... Closed exits from l3: 4 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): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007009s Time used: 0.00695 LOG: SAT solveNonLinear - Elapsed time: 0.007009s Cost: 0; Total time: 0.00695 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg3 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l3: 2 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> 1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg2, arg2 <= arg3, arg3 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg2, arg2 = arg3, OPEN EXITS: > Conditions are reachable! Program does NOT terminate