NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> (arg1 - 1), arg2 -> (arg2 + 1)}> undef7, arg2 -> undef8}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)> arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, 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 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 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.0037 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000977s Ranking function: 1 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000446s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001549s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005591s Time used: 0.005454 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001623s Time used: 4.00062 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119734s Time used: 0.073705 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000921s Time used: 1.00056 LOG: SAT solveNonLinear - Elapsed time: 1.120656s Cost: 2; Total time: 1.07426 Failed at location 2: arg1 <= arg2 Failed at location 2: arg2 <= arg1 Before Improving: Quasi-invariant at l2: arg1 <= arg2 Quasi-invariant at l2: arg2 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009985s Remaining time after improvement: 0.997927 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= arg2 Quasi-invariant at l2: arg2 <= arg1 [ 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: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= arg2 and entry LOG: CALL check - Post:arg1 <= arg2 - Process 1 * Exit transition: * Postcondition : arg1 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000923s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001052s Calling Safety with literal arg2 <= arg1 and entry LOG: CALL check - Post:arg2 <= arg1 - Process 2 * Exit transition: * Postcondition : arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000752s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000881s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= arg2 , arg2 <= arg1 , Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000979s Ranking function: 1 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000469s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001598s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005450s Time used: 0.005315 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002067s Time used: 4.00103 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.016605s Time used: 4.00081 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006554s Time used: 1.00048 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016279s Time used: 0.010163 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001045s Time used: 1.00084 LOG: SAT solveNonLinear - Elapsed time: 1.017324s Cost: 1; Total time: 1.011 Quasi-ranking function: 50000 + arg1 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000521s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001993s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006476s Time used: 0.006331 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002275s Time used: 4.00126 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.047916s Time used: 4.00096 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006622s Time used: 1.00064 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018392s Time used: 0.012037 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001294s Time used: 1.00102 LOG: SAT solveNonLinear - Elapsed time: 1.019687s Cost: 1; Total time: 1.01305 Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002301s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007115s Time used: 0.006963 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003024s Time used: 4.00197 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.671217s Time used: 0.6253 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.953967s Time used: 0.950413 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017246s Time used: 0.011391 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.983760s Time used: 0.983608 LOG: SAT solveNonLinear - Elapsed time: 1.001006s Cost: 1; Total time: 0.994999 Quasi-ranking function: 50000 - arg1 - 2*arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000734s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003405s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007472s Time used: 0.007311 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.970986s Time used: 0.970599 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000185s Time used: 0.996811 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.996993s Time used: 0.992961 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023520s Time used: 0.013012 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.981981s Time used: 0.98183 LOG: SAT solveNonLinear - Elapsed time: 1.005501s Cost: 1; Total time: 0.994842 Termination implied by a set of invariant(s): Invariant at l2: 1 <= 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 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 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 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + 2*arg1 + arg2 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000917s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003892s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012653s Time used: 0.012475 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.953570s Time used: 0.953173 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000162s Time used: 0.996809 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997075s Time used: 0.993092 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020462s Time used: 0.014559 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.996396s Time used: 0.996244 LOG: SAT solveNonLinear - Elapsed time: 1.016858s Cost: 1; Total time: 1.0108 Termination implied by a set of invariant(s): Invariant at l2: 1 <= 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 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 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 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000991s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003802s Trying to remove transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009662s Time used: 0.009489 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.936317s Time used: 0.935654 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000063s Time used: 0.996379 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021587s Time used: 1.01746 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975816s Time used: 0.969676 Proving non-termination of subgraph 1 Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008595s Time used: 0.008402 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008298s Time used: 0.008292 LOG: SAT solveNonLinear - Elapsed time: 0.016893s Cost: 1; Total time: 0.016694 Failed at location 2: 1 + arg1 <= arg2 Before Improving: Quasi-invariant at l2: 1 + arg1 <= arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002078s Remaining time after improvement: 0.99887 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + arg1 <= 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): -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + arg1 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + arg1 <= arg2, OPEN EXITS: > Conditions are reachable! Program does NOT terminate